Attainment of the best strong-convexity modulus
ProvedPGDMap20261031.pgd_best_modulusconvex-optimizationperformance-estimationproximal-gradient
Statement
Let , including , and let with its Euclidean inner product and norm. A penalty datum is an arbitrary set and a total function . Call it admissible when is nonempty, its epigraph is closed, and is convex on the convex set . For , say that has modulus on when, for all and all real , . Write , using the total real supremum operation, whose value is for an empty or unbounded-above set. For every and every admissible whose domain contains two distinct points, and has modulus on .
Preamble
import Definitions.Def_PGDMap20261031_PGD open PGDMap20261031
Formal statement
theorem PGDMap20261031.pgd_best_modulus : BestModulusClaim := by sorry
Source
Exact Residual Curves for Proximal Gradient Descent with a Fixed Penalty, manuscript dated 2026-10-30, Theorem 1 proof, p. 7; local source: 01_PGD_Exact_Residual_Curve.pdf