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 be a KKT point of a program with active inequality set , multiplier , and active constraint vector , with . Assume LICQ, strict complementarity for , and the second-order sufficient condition for every nonzero , where and .
For all sufficiently large fixed , the PHR augmented-Lagrangian multiplier update has a local contraction when each inner minimization is solved exactly. When , the same local multiplier convergence holds for inner points with stationarity residuals whose sum is sufficiently small, provided each point stays in the local strongly convex branch. More precisely, there are local radii and , a strong-convexity constant , and a contraction factor such that convergence holds whenever where and is a Lipschitz constant for on the local primal neighborhood. Inactive multipliers are initialized at zero. If has zero components, the multiplier update is absent and the bound involving is omitted; sufficiently local inner points with summable residuals converge to 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 ; its input tolerances must be chosen so these reports satisfy the displayed summability bound.
Facts & Assumptions
Given: The program, KKT pair, LICQ, strict complementarity, positive curvature on , fixed , and summable inner residuals.
Inequality constrained programs, tangent cones, constraint qualifications, and KKT defines LICQ, KKT stationarity, and the , convention.
Equality and inequality augmented Lagrangians and multiplier updates defines the PHR Lagrangian and projected multiplier update.
The Euclidean implicit function theorem with derivative formula gives a local solution branch for a equation with invertible derivative and the derivative formula for that branch.
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.
LICQ holds; every active inequality multiplier is strictly positive; the Lagrangian Hessian is positive definite on ; inactive multipliers start at zero; and inner points stay in a neighborhood where the PHR branches used below remain fixed.
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
Write , and . Strict complementarity and continuity give a neighborhood in which every active inequality satisfies and every inactive inequality, whose multiplier is initialized at zero, satisfies . On this branch, [F2] reduces the -dependent augmented Lagrangian to where . Its gradient vanishes at .
The -Hessian at the base point is . If , the assumed condition says . For , choose orthonormal matrices spanning and its orthogonal complement, respectively; then is invertible. In this basis the tangent block is when its dimension is positive, the cross blocks are those of , and the normal block is . Its Schur complement over the tangent block is , where ; if the tangent block is empty, take . Since , this Schur complement is positive definite for sufficiently large . Hence .
If , apply [F3] to . Its derivative is , which is invertible by step 1.2, and its derivative is . Therefore there is a local branch with and If , the empty-multiplier branch consists of the local minimizer . 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.
For , the exact multiplier map is , so In the orthonormal coordinates of step 1.2, block elimination gives , where is symmetric. Thus . Its eigenvalues are , which have absolute value less than for all sufficiently large . Continuity of then gives a closed multiplier ball on which is a contraction with some factor . For the multiplier update is absent.
Let be an inner point in the selected branch with residual at most , and let be the exact branch minimizer. Strong convexity with constant gives After cancellation (with the zero-distance case immediate), . The multiplier update is on the same PHR branch, so its difference from has norm at most . Hence The stated sum bound keeps this recurrence inside the multiplier ball and keeps every inner point within the primal branch tube.
Iterating the inequality gives The first term tends to zero. For the sum, any fixed finite prefix tends to zero as , while the remaining tail is bounded by , which tends to zero as . Therefore . Also because it is summable, so step 4.1 gives and continuity gives . When , step 1.2 gives a strongly convex local objective and the same residual estimate directly yields .
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
- Dimitri P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods (standard reference, not scraped)
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, 2nd ed. (standard reference, not scraped)