Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Sqp active set and augmented lagrangian methods — Examples

1 · Prerequisites

2 · Summary

The design example solves a two-variable demand-constrained QP and checks that its active KKT certificate also identifies the original convex problem's unique minimizer. The Maratos calculation evaluates the L1 merit change for a full SQP step and the corrected step exactly, showing why a positive model prediction need not make the nonlinear full step acceptable. The equality quadratic example computes both the augmented-Lagrangian multiplier contraction and the penalty-dependent Hessian condition number, so the penalty tradeoff is visible in exact formulas.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Two-component design with an active demand constraint

Statement

Consider the design problem min⁡x∈R212(x12+x22)subject to 1−x1−x2≤0. At x0=(0,0), use B=I in the SQP quadratic subproblem. The exact active-set solve returns p=(1/2,1/2), and x0+p is the unique global minimizer of the nonlinear problem, with active demand constraint and multiplier 1/2.

Facts & Assumptions

Given: The quadratic objective, linear demand constraint, and SQP subproblem and exact active-set conventions.

[F1]

The linearized quadratic subproblem in sequential quadratic programming defines the SQP model as the objective gradient plus a positive-definite quadratic term and affine linearized constraints.

[F2]

Exact exhaustive active-set solve for the SQP quadratic subproblem tests feasible active KKT supports and returns an accepted exact candidate.

[F3]
[F4]

Convex KKT conditions certify a global minimum and an outward normal: a feasible KKT tuple for a convex objective with affine constraints certifies global optimality.

[A1]

The SQP model matrix at x0 is I, and all arithmetic is exact.

Proof

1.1givenA1F1algebra

At x0, ∇f(x0)=0 and the linearized inequality is 1−p1−p2≤0. The unconstrained minimizer p=0 is infeasible. On the active face p1+p2=1, stationarity for q(p)=12∥p∥22 is p−λ(1,1)T=0; combining with the face equation gives p1=p2=λ=1/2. This point is feasible with nonnegative multiplier.

2.1A1F2F3step 1.1

The positive-definite QP has a unique minimizer; its feasible KKT tuple passes the active-set acceptance filters in [F2]. By [F3] the returned step is exactly (1/2,1/2).

3.1F4algebrastep 2.1∎

The nonlinear point x∗=(1/2,1/2) is feasible and has ∇f(x∗)=(1/2,1/2), ∇g(x∗)=(−1,−1), and multiplier λ∗=1/2. Thus stationarity holds, the multiplier is nonnegative, and complementarity holds with g(x∗)=0. Since the objective is convex and the constraint affine, [F4] proves global optimality; strict convexity of the objective makes the minimizer unique.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

A full SQP step is rejected by the L1 merit test and repaired by SOC

Statement

Let h(x)=x12+x22−1=0 and f(x)=2(x12+x22−1)−x1. At a feasible point x=(cos⁡θ,sin⁡θ)=(c,s), use multiplier estimate ν=−3/2 and SQP Hessian model B=I. For nonzero sufficiently small θ, the SQP step p=(s2,−sc) has predicted decrease Dρ=s2>0, but its full step increases the L1 merit for every ρ>0. The minimum-norm SOC correction makes the full corrected step pass the Armijo test with σ=1/4 for every fixed ρ>0 and all sufficiently small nonzero θ.

Facts & Assumptions

Given: The equality-constrained SQP and L1 merit definitions, the SOC formula, and c=cos⁡θ, s=sin⁡θ.

[F1]

The linearized quadratic subproblem in sequential quadratic programming imposes h(x)+Dh(x)p=0 in the subproblem.

[F2]

L1 exact-penalty merit and predicted decrease for SQP defines the merit and predicted decrease Dρ.

[F3]

Minimum-norm second-order correction for identified active constraints sets w=−Dh(x)T(Dh(x)Dh(x)T)−1h(x+p).

[F4]

Second-order correction reduces the active constraint residual to cubic order gives the local quadratic correction size and cubic active-residual order under its smooth full-rank hypotheses.

[F5]

L1 merit globalization with finite penalty and backtracking budgets tests the full SOC candidate against the Armijo threshold.

[A1]

θ is sufficiently small and nonzero, ρ>0 is fixed, B=I, the multiplier estimate is −3/2, and σ=1/4.

Proof

1.1givenF1A1algebra

At x=(c,s), h(x)=0, Dh(x)=2(c,s), and ∇f(x)=4(c,s)−(1,0). The unit tangent t=(−s,c) satisfies tT∇f(x)=s. The QP constraint gives p∈span⁡(t); minimizing ∇f(x)Tp+12∥p∥22 on this line gives p=−st=(s2,−sc). Its QP multiplier is −(4−c)/2, since p+∇f(x)=(4−c)(c,s).

1.2A1F3algebra

Here Dh(x)Dh(x)T=4, so [F3] gives w=(−cs2/2,−s3/2) and ∥w∥2=s2/2. Direct substitution into the quadratic constraint yields h(x+p+w)=s44. The corrected first coordinate is c+s2(1−c/2), so the corrected objective change is −s2(1−c/2)+s4/2. Adding the penalty contribution gives ψρ(x+p+w)−ψρ(x)=−s2(1−c/2)+s4(1/2+ρ/4).

2.1A1F2step 1.1algebra

Since xTp=0 and ∥p∥22=s2, h(x+p)=s2. Also ∇f(x)Tp=−s2, so [F2] gives Dρ=s2. The objective changes by s2, while the equality violation changes from zero to s2; hence the full-step merit change is (1+ρ)s2>0, which fails the Armijo right side −σs2<0.

3.1A1F4F5step 1.2algebra∎

Divide the corrected merit change plus σDρ by s2. With σ=1/4, the result is −1+c/2+s2(1/2+ρ/4)+1/4, which tends to −1/4 as θ→0. It is therefore negative for all sufficiently small nonzero θ, proving the SOC Armijo test passes. The explicit O(s2) correction norm and O(s4) residual satisfy the quadratic-size and cubic-residual bounds of [F4].

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

A quadratic equality model shows the AL conditioning tradeoff

Example

For f(x,y)=12(x2+y2) subject to h(x,y)=y=0, the equality augmented Lagrangian with penalty ρ>0 and multiplier ν has Hessian diag⁡(1,1+ρ). Its exact inner minimizer is (0,−ν/(1+ρ)), and the multiplier update sends ν to ν/(1+ρ). Thus increasing ρ improves the exact multiplier contraction factor while worsening the inner Hessian condition number to 1+ρ.

Facts & Assumptions

Given: The equality augmented-Lagrangian formula and multiplier update, with fixed ρ>0.

[F1]

Equality and inequality augmented Lagrangians and multiplier updates defines LρE=f+νh+ρ2h2 and ν+=ν+ρh(x+).

[F2]

Finite-budget augmented-Lagrangian multiplier method applies that update after an inner minimization.

[A1]

An exact inner routine computes this closed-form minimizer and returns success within its finite inner cap M≥1; arithmetic is exact and ρ>0.

Verification

1.1givenA1F1algebra

Substitution into [F1] gives LρE(x,y;ν)=12x2+12(1+ρ)y2+νy. Its Hessian is diagonal with eigenvalues 1 and 1+ρ, so the Euclidean spectral condition number is 1+ρ.

2.1A1F1F2step 1.1algebra∎

The gradient equations are x=0 and (1+ρ)y+ν=0; the unique inner minimizer is (0,−ν/(1+ρ)). Its constraint value is −ν/(1+ρ), so [F1] gives ν+=ν−ρν/(1+ρ)=ν/(1+ρ). Its absolute contraction factor is 1/(1+ρ), which decreases as ρ increases while the condition number in step 1.1 increases.

Sources