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 have a saddle point for the Lagrangian in Scaled two-block ADMM with explicit capped-solve statuses, with , and every subproblem in the exact ADMM sequence is attained. Put and For every , The index begins at : an arbitrary initial need not satisfy a previous -subproblem optimality condition. Also, with and , every exact sweep satisfies
Facts & Assumptions
Given: A saddle point, exact ADMM sweeps, , and the notation above.
A saddle point exists, , and every ADMM subproblem is attained exactly.
Saddle points of extended-real Lagrangians: for every , with the center finite.
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.
The adjoint is characterised by : adjoints move between inner products.
Proof
For every , the right saddle inequality at and feasibility give ; the same argument with gives . Thus [F4] gives both saddle subgradient inclusions. For , the preceding exact sweep also gives from [F2]. The inequalities at and read and . Combining them gives . This is the sign needed below and is why the estimate starts at .
Adding the two defining subgradient inequalities shows subgradient monotonicity. At the -block this gives At the -block it gives . Add the two inequalities and use to obtain Substitute .
The identity gives The analogous expansion for is Add these identities, use step 2.1, and then use step 1.1 to bound . The asserted energy descent follows.
The two subgradient inequalities [F2,F4] at against give Replace by to obtain the upper estimate. The right saddle inequality [F3] at is , which rearranges to the lower estimate.
Depends on
- Scaled two-block ADMM with explicit capped-solve statuses
- Optimality relations for exact two-block ADMM subproblems
- Saddle points of extended-real Lagrangians
- Subdifferentials of proper extended-real convex functions
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
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
- Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Appendix A (standard reference, not scraped)
- Jonathan Eckstein and Dimitri P. Bertsekas, On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators, §4 (standard reference, not scraped)