Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Augmented-Lagrangian multipliers converge locally with summable inner residuals

Statement

Let x∗ be a KKT point of a C2 program with active inequality set I=I(x∗), multiplier μ∗=(ν∗,λ∗,I), and active constraint vector c=(h,gI), with r=dim⁡c. Assume LICQ, strict complementarity λ∗,i>0 for i∈I, and the second-order sufficient condition dTH∗d>0 for every nonzero d∈ker⁡A∗, where A∗=Dc(x∗) and H∗=∇xx2L(x∗,μ∗).

For all sufficiently large fixed ρ, the PHR augmented-Lagrangian multiplier update has a local contraction when each inner minimization is solved exactly. When r>0, the same local multiplier convergence holds for inner points x^k with stationarity residuals ϵk=∥∇xLρ(x^k,νk,λk)∥2 whose sum is sufficiently small, provided each point stays in the local strongly convex branch. More precisely, there are local radii δμ and dx>0, a strong-convexity constant α>0, and a contraction factor q<1 such that convergence holds whenever ∥μ0−μ∗∥2≤δμ/2,∑k=0∞ϵk≤min⁡{αdx,(1−q)δμ2C}, where C=ρLc/α and Lc is a Lipschitz constant for c on the local primal neighborhood. Inactive multipliers are initialized at zero. If c has zero components, the multiplier update is absent and the bound involving C is omitted; sufficiently local inner points with summable residuals converge to x∗ by strong convexity.

This is a limit theorem for an infinite sequence of successful inner returns. The contraction estimates apply to any successful prefix of the finite-budget procedure; the limit conclusion applies only to an infinite continuation whose calls continue to return within their finite inner caps. For that procedure, the residual sequence in this theorem is the reported ϵ^k; its input tolerances must be chosen so these reports satisfy the displayed summability bound.

Facts & Assumptions

Given: The C2 program, KKT pair, LICQ, strict complementarity, positive curvature on ker⁡A∗, fixed ρ, and summable inner residuals.

[F1]

Inequality constrained programs, tangent cones, constraint qualifications, and KKT defines LICQ, KKT stationarity, and the g≤0, λ≥0 convention.

[F2]

Equality and inequality augmented Lagrangians and multiplier updates defines the PHR Lagrangian and projected multiplier update.

[F3]

The Euclidean implicit function theorem with derivative formula gives a local C1 solution branch for a C1 equation with invertible derivative and the derivative formula for that branch.

[F4]

Finite-budget augmented-Lagrangian multiplier method uses the displayed inner stationarity residual and projected multiplier update, with finite inner and outer caps and explicit exhaustion/failure returns.

[A1]

LICQ holds; every active inequality multiplier is strictly positive; the Lagrangian Hessian is positive definite on ker⁡A∗; inactive multipliers start at zero; and inner points stay in a neighborhood where the PHR branches used below remain fixed.

[A2]

Every inner call in the sequence under consideration returns successfully within its finite cap with the stated residual; an inner-budget-exhausted or inner-failure status ends the finite procedure and is not a convergence step.

Proof

1.1givenF1F2algebraalgebra

Write A=A∗, H=H∗ and r=dim⁡c. Strict complementarity and continuity give a neighborhood in which every active inequality satisfies λi+ρgi(x)>0 and every inactive inequality, whose multiplier is initialized at zero, satisfies λj+ρgj(x)<0. On this branch, [F2] reduces the x-dependent augmented Lagrangian to Φρ(x,μ)=f(x)+μTc(x)+ρ2∥c(x)∥22, where μ=(ν,λI). Its gradient vanishes at (x∗,μ∗).

1.2givenalgebrachoose

The x-Hessian at the base point is Wρ=H+ρATA. If r=0, the assumed condition says H≻0. For r>0, choose orthonormal matrices Z,Y spanning ker⁡A and its orthogonal complement, respectively; then C0=AY is invertible. In this basis the tangent block is HT=ZTHZ≻0 when its dimension is positive, the cross blocks are those of H, and the normal block is YTHY+ρC0TC0. Its Schur complement over the tangent block is D+ρC0TC0, where D=YTHY−YTHZHT−1ZTHY; if the tangent block is empty, take D=YTHY. Since C0TC0≻0, this Schur complement is positive definite for sufficiently large ρ. Hence Wρ≻0.

2.1F3step 1.2algebra

If r>0, apply [F3] to G(x,μ)=∇xΦρ(x,μ)=0. Its x derivative is Wρ, which is invertible by step 1.2, and its μ derivative is AT. Therefore there is a local C1 branch x(μ) with x(μ∗)=x∗ and Dx(μ∗)=−Wρ−1AT. If r=0, the empty-multiplier branch consists of the local minimizer x∗. By continuity of the Hessian, after shrinking to a convex neighborhood Φρ(⋅,μ) is uniformly strongly convex there; its stationary branch point is its unique local minimizer.

3.1step 1.2step 2.1algebra

For r>0, the exact multiplier map is T(μ)=μ+ρc(x(μ)), so DT(μ∗)=I−ρAWρ−1AT. In the orthonormal coordinates of step 1.2, block elimination gives AWρ−1AT=C0(D+ρC0TC0)−1C0T =(ρI+E)−1, where E=C0−TDC0−1 is symmetric. Thus DT(μ∗)=E(ρI+E)−1. Its eigenvalues are ei/(ρ+ei), which have absolute value less than 1 for all sufficiently large ρ. Continuity of DT then gives a closed multiplier ball on which T is a contraction with some factor q<1. For r=0 the multiplier update is absent.

4.1A1A2F2F4step 2.1step 3.1algebra

Let x^k be an inner point in the selected branch with residual at most ϵk, and let x(μk) be the exact branch minimizer. Strong convexity with constant α gives α∥x^k−x(μk)∥22≤⟨∇Φρ(x^k,μk)−∇Φρ(x(μk),μk),x^k−x(μk)⟩≤ϵk∥x^k−x(μk)∥2. After cancellation (with the zero-distance case immediate), ∥x^k−x(μk)∥2≤ϵk/α. The multiplier update is on the same PHR branch, so its difference from T(μk) has norm at most ρLcϵk/α=Cϵk. Hence ∥μk+1−μ∗∥2≤q∥μk−μ∗∥2+Cϵk. The stated sum bound keeps this recurrence inside the multiplier ball and keeps every inner point within the primal branch tube.

5.1givenA1A2step 4.1algebra

Iterating the inequality gives ∥μk−μ∗∥2≤qk∥μ0−μ∗∥2+C∑j=0k−1qk−1−jϵj. The first term tends to zero. For the sum, any fixed finite prefix tends to zero as k→∞, while the remaining tail is bounded by C∑j≥Jϵj, which tends to zero as J→∞. Therefore μk→μ∗. Also ϵk→0 because it is summable, so step 4.1 gives x^k−x(μk)→0 and continuity gives x^k→x∗. When r=0, step 1.2 gives a strongly convex local objective and the same residual estimate directly yields x^k→x∗.

6.1step 1.1step 1.2step 2.1step 3.1step 4.1step 5.1∎

The hypotheses and local restrictions used above are exactly the regularity, branch, residual, and successful-inner-call conditions in the Statement and [A2]. This proves the limit claim for the successful update sequence; a finite dispatch may return a cap or failure status first and no global convergence is asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources