First-Order Augmented Lagrangian Method

• First-Order Augmented Lagrangian Method is an algorithmic framework for solving constrained minimax problems via gradient and proximal operations.
• It integrates a safeguarded augmented Lagrangian formulation with a two-stage first-order subsolver that exploits strong concavity for acceleration.
• The method achieves improved operation complexity, reducing iterations and facilitating faster convergence in large-scale nonconvex optimization scenarios.

A first-order augmented Lagrangian method is an algorithmic framework for solving constrained minimax optimization problems, particularly those exhibiting nonconvexity in the minimization variable and strong concavity in the maximization variable. The first-order approach utilizes only gradient and proximal operations, eschewing second-order information, which enables scalability to high-dimensional problems and facilitates efficient subproblem solutions by harnessing structure such as strong concavity. Recent advances, notably the method introduced by Z. Lu and S. Mei, establish operation complexity bounds for finding approximately stationary (ε-KKT) solutions in nonconvex–strongly-concave constrained minimax settings, sharply improving upon prior results by an order in ε (Lu et al., 28 Dec 2025).

1. Constrained Nonconvex–Strongly-Concave Minimax Problem

The method targets constrained minimax programs of the form

$$\min_{x\in\mathbb R^n}\;\max_{y\in\mathbb R^m}\;\Bigl\{F(x,y)\!:=f(x,y)+p(x)-q(y)\Bigr\} \quad \text{s.t. } c(x)\le0,\;d(x,y)\le0$$

where $f$ is continuously differentiable, $p$ and $q$ are proper closed convex regularizers (with efficient proximal mappings), $c$ and $d$ are smooth constraint mappings, and the domains of $p,q$ are compact. The minimization in $x$ may be nonconvex, while $f(x,\cdot)$ is assumed $\sigma$-strongly concave.

Assumptions include:

• $f$0 is $f$1-Lipschitz,
• $f$2 and $f$3 are smooth and Lipschitz; $f$4 convex,
• robust MFCQ and uniform Slater conditions for feasible sets,
• existence of an $f$5-feasible initial point.

2. Safeguarded Augmented Lagrangian Formulation

The core algorithmic step is the construction of a safeguarded augmented Lagrangian: $f$6 where $f$7 are dual multipliers for the respective constraints, and $f$8 denotes componentwise max with zero. The positive quadratic term enforces feasibility for minimization ($f$9), the negative counterpart for maximization ($p$0).

The outer loop iterates over penalty parameter $p$1 and dual variables, at each stage solving the unconstrained nonconvex–strongly-concave minimax subproblem

$p$2

via a first-order subsolver described below.

3. First-Order Subproblem Solver Leveraging Strong Concavity

Each AL subproblem is solved using an inner two-stage algorithm:

• Proximal-point regularization: Transforms the nonconvex–strongly-concave objective $p$3 into a strongly-convex–strongly-concave variant

$p$4

which is strongly convex in $p$5, strongly concave in $p$6, and globally smooth.

• Optimal first-order primal-dual method: A variant of accelerated primal-dual schemes (cf. [Kovalev–Gasnikov ’22]) achieves $p$7 complexity for subproblem stationarity, where $p$8.

The inner solver alternates regularization and primal-dual updates until the norm $p$9 drops below a prescribed tolerance.

4. Algorithm Structure and ε-KKT Characterization

The full algorithm comprises:

• Outer loop: iteratively increases the penalty parameter $q$0 (typically set as $q$1 where $q$2 geometrically decays), updates multipliers, and solves subproblems to progressively higher accuracy.
• Inner loop: performs strongly-convex–strongly-concave minimax optimization as described above.

The output $q$3 is defined as an ε-KKT solution if: $q$4 which certifies near-stationarity, near-feasibility, and near-complementarity.

5. Complexity Results and Accelerated Guarantees

The main theoretical advance is an improved operation complexity for finding an $q$5-KKT solution: $q$6 fundamental operations (gradients of $q$7 and proximal mappings of $q$8) under suitable assumptions. This improves the previous best-known complexity by a factor of $q$9, enabled by exploiting strong concavity in $c$0 for accelerated subproblem solves. Specifically, each outer iteration costs $c$1 operations, and $c$2 outer iterations suffice.

Comparison:

Problem Structure	Best Known Complexity Before	New Complexity	Key Advance
Concave, not strongly-concave	$c$3	$c$4	$c$5 order exploitation of strong concavity

6. Numerical Experiments and Empirical Evidence

Experiments validate theoretical results:

• Unconstrained quadratic minimax (random $c$6): Compared Algorithm 2 (inner solver) vs. Alternating Gradient Projection [Xu–Lan ’23]; both obtain similar objective values, but the new method is about $c$7 faster for dimensions $c$8, with even larger speedup as $c$9 increase.
• Constrained quadratic minimax (linear inequalities): Compared full AL method to previous ALM [Lu–Mei ’24]; again matched solution quality, but ran $d$0–$d$1 faster on medium-scale problems ($d$2) due to fewer inner iterations required.

7. Implications and Scope

This first-order augmented Lagrangian method establishes a new benchmark for large-scale nonconvex–strongly-concave minimax optimization under functional constraints. The framework’s modularity permits integration with various proximal mappings and constraint sets, provided regularity and qualification hold. The pivotal role of strong concavity enables strict acceleration, relevant in adversarial machine learning, saddle-point optimization, and robust control.

The approach relies fundamentally on first-order oracles, multiplier updates, and safeguarding of dual variables—ensuring both theoretical and empirical computational superiority over earlier methods in this class (Lu et al., 28 Dec 2025).