Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Two-block ADMM energy descent and objective gap estimates

Statement

Suppose proper closed convex f,g have a saddle point (x∗,z∗,y∗) for the Lagrangian in Scaled two-block ADMM with explicit capped-solve statuses, with Kx∗+Lz∗=c, and every subproblem in the exact ADMM sequence is attained. Put Δzk+1=zk+1−zk and Vk=1ρ∥yk−y∗∥22+ρ∥L(zk−z∗)∥22. For every k≥1, Vk+1≤Vk−ρ∥rk+1∥22−ρ∥LΔzk+1∥22. The index begins at k=1: an arbitrary initial z0 need not satisfy a previous z-subproblem optimality condition. Also, with pk=f(xk)+g(zk) and p∗=f(x∗)+g(z∗), every exact sweep satisfies pk+1−p∗≤−⟨yk+1,rk+1⟩+ρ⟨LΔzk+1,rk+1−L(zk+1−z∗)⟩, p∗−pk+1≤⟨y∗,rk+1⟩.

Facts & Assumptions

Given: A saddle point, exact ADMM sweeps, ρ>0, and the notation above.

[A1]

A saddle point exists, ρ>0, and every ADMM subproblem is attained exactly.

[F1]

Scaled two-block ADMM with explicit capped-solve statuses: rk+1=Kxk+1+Lzk+1−c and yk+1−yk=ρrk+1.

[F2]

Optimality relations for exact two-block ADMM subproblems: ak+1=−K∗yk+1+ρK∗LΔzk+1∈∂f(xk+1) and bk+1=−L∗yk+1∈∂g(zk+1).

[F3]

Saddle points of extended-real Lagrangians: L((x∗,z∗),y)≤p∗≤L((x,z),y∗) for every x,z,y, with the center finite.

[F4]

Subdifferentials of proper extended-real convex functions: for a finite-valued point of a proper convex extended-real function, each subgradient gives its defining inequality against every competitor.

Proof

1.1A1F2F3F4F5givenalgebra

For every x∈dom⁡f, the right saddle inequality at (x,z∗) and feasibility give f(x)≥f(x∗)+⟨−K∗y∗,x−x∗⟩; the same argument with (x∗,z) gives −L∗y∗∈∂g(z∗). Thus [F4] gives both saddle subgradient inclusions. For k≥1, the preceding exact sweep also gives −L∗yk∈∂g(zk) from [F2]. The inequalities at zk+1 and zk read g(zk+1)−g(zk)≤−⟨yk+1,LΔzk+1⟩ and g(zk+1)−g(zk)≥−⟨yk,LΔzk+1⟩. Combining them gives ⟨yk+1−yk,LΔzk+1⟩≤0. This is the sign needed below and is why the estimate starts at k=1.

2.1A1F2F3F4F5step 1.1algebra

Adding the two defining subgradient inequalities shows subgradient monotonicity. At the f-block this gives 0≤⟨ak+1+K∗y∗,xk+1−x∗⟩=−⟨yk+1−y∗,K(xk+1−x∗)⟩+ρ⟨LΔzk+1,K(xk+1−x∗)⟩. At the g-block it gives 0≤⟨bk+1+L∗y∗,zk+1−z∗⟩=−⟨yk+1−y∗,L(zk+1−z∗)⟩. Add the two inequalities and use Kx∗+Lz∗=c to obtain ⟨yk+1−y∗,rk+1⟩≤ρ⟨LΔzk+1,K(xk+1−x∗)⟩. Substitute K(xk+1−x∗)=rk+1−L(zk+1−z∗).

3.1A1F1step 1.1step 2.1algebra

The identity yk+1−yk=ρrk+1 gives ∥yk+1−y∗∥2−∥yk−y∗∥2ρ=2⟨yk+1−y∗,rk+1⟩−ρ∥rk+1∥2. The analogous expansion for L(zk−z∗) is ρ(∥L(zk+1−z∗)∥2−∥L(zk−z∗)∥2)=2ρ⟨LΔzk+1,L(zk+1−z∗)⟩−ρ∥LΔzk+1∥2. Add these identities, use step 2.1, and then use step 1.1 to bound 2⟨yk+1−yk,LΔzk+1⟩≤0. The asserted energy descent follows.

4.1A1F2F3F4step 2.1algebra∎

The two subgradient inequalities [F2,F4] at (xk+1,zk+1) against (x∗,z∗) give pk+1−p∗≤⟨ak+1,xk+1−x∗⟩+⟨bk+1,zk+1−z∗⟩=−⟨yk+1,rk+1⟩+ρ⟨LΔzk+1,K(xk+1−x∗)⟩. Replace K(xk+1−x∗) by rk+1−L(zk+1−z∗) to obtain the upper estimate. The right saddle inequality [F3] at (xk+1,zk+1) is pk+1+⟨y∗,rk+1⟩≥p∗, which rearranges to the lower estimate.

Depends on

Used by

Dependency tree · two levels

13 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