(5.3a), proof of Theorem 5.5, p. 19 — prox_{γφ₁} ⊇ A argmin{f + (1/(2γ))‖A · − s‖²} for φ₁ = (Af)
ProvedNonconvexDRS.ADMM.eq_5_3aadmmimage-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-mapping
Let , , and , and set . If minimizes , then
This is the inclusion that turns the ADMM -update into the first proximal step of DRS.
Preamble
import Mathlib import Definitions.Def_NonconvexSplitting_Shared_LimitingSubdiff import Definitions.Def_NonconvexDRS_ADMM_Setting open NonconvexSplitting.Shared open Filter Topology open scoped InnerProductSpace
Formal statement
namespace NonconvexDRS.ADMM
/-- (5.3a), proof of Theorem 5.5, p. 19: with `φ₁ = (Af)`,
`prox_{γφ₁}(s) ⊇ A argmin { f + (1/(2γ))‖A · - s‖² }`. -/
theorem eq_5_3a {m p : ℕ} (f : EuclideanSpace ℝ (Fin m) → EReal)
(A : EuclideanSpace ℝ (Fin m) →L[ℝ] EuclideanSpace ℝ (Fin p))
(γ : ℝ) (hγ : 0 < γ) (s : EuclideanSpace ℝ (Fin p)) (x : EuclideanSpace ℝ (Fin m))
(hx : ∀ x', f x + ((‖A x - s‖ ^ 2 / (2 * γ) : ℝ) : EReal) ≤
f x' + ((‖A x' - s‖ ^ 2 / (2 * γ) : ℝ) : EReal)) :
A x ∈ NonconvexDRS.Tight.proxSet (imageFn A f) γ s := by sorry
end NonconvexDRS.ADMM
Source
Themelis & Patrinos, Douglas-Rachford splitting and ADMM for nonconvex optimization: tight convergence results, arXiv:1709.05747v4, p. 19, (5.3a) in the proof of Theorem 5.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.