p. 5 — the affine map F is monotone
ProvedExtADMM.Orth.F_monotoneadmmconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality
Let be the affine four-block map in (2.5c), with first three blocks and last block . For any four-block points , it is monotone:
This is the monotonicity statement used when passing from the variational inequality at a solution to the contraction estimate. It does not require convexity of the objective or orthogonality of the matrices.
Preamble
import Definitions.Def_ExtADMM_Orth_Setting set_option autoImplicit false
Formal statement
namespace ExtADMM.Orth
/-- The affine mapping F of (2.5c) is monotone (p. 5). -/
theorem F_monotone {n1 n2 n3 p : ℕ} (P : Problem n1 n2 n3 p)
(a b : Pt n1 n2 n3 p) :
0 ≤ pair (a - b) (P.F a - P.F b) := by sorry
end ExtADMM.Orth
Source
Chen, He, Ye & Yuan, The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent, Math. Program., DOI 10.1007/s10107-014-0826-5 (authors' version of January 22, 2014), p. 5, after (2.5c)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.