The DCA mapping bound on the convex-objective branch
OpenPGDRevision20261113.dca_convex_objective_boundbregman-geometryconvex-optimizationproximal-gradient
Let be proper, closed and -strongly convex. Let be differentiable, with both
convex. Assume
Write . Starting from , perform DCA updates satisfying
For , let when , and . The terminal displacement obeys
The minimum-displacement bound follows on the same parameter region. This statement covers the complete convex-objective branch, including both signs of .
Formalization Note. The DCA subgradient inclusion is represented by minimization of the convex function . The zero-argument energy is encoded as extended-real infinity before taking the minimum.
Related results. Fixed-penalty exact curve · Optimal constant stepsizes
Preamble
import Definitions.Def_PGDRevision20261113_Euclidean open PGDRevision20261113
Formal statement
theorem PGDRevision20261113.dca_convex_objective_bound : DCAConvexObjectiveClaim := by sorry
Source
Author manuscript: Exact Residual Bounds and Optimal Geometry Selection for Proximal Gradient Methods, revised reading edition, 13 November 2026, Corollary 2.8, p. 7; source file sections/02_dca_consequence.tex, label cor:dca.