Theorem 1: optimal constant PGD stepsizes
ProvedPGDMap20261031.optimal_constant_stepsizesconvex-optimizationperformance-estimationproximal-gradient
01 · The optimization variable
Let and . In the normalized range , consider the exact PGD curve
with
02 · A unique optimal constant step
The curve has a unique minimizer , characterized by
This is a strict global minimum on the entire allowed interval . The actual step is .
03 · Parameter laws and scalar equations
The optimal normalized step strictly increases with at fixed and with at fixed . It tends to as . Let . Its equivalent scalar equations are
The asymptotic statements are
04 · Small horizons and the open endpoint
For two updates,
For one update, the unique minimizer is when . When , the infimum is approached as and is not attained within the allowed open interval.
Formalization note. The optimizer is defined from the infimum of the actual branch-crossing set, not supplied as a free variable. The existence, uniqueness and all parameter laws remain explicit formalization targets.
Preamble
import Definitions.Def_PGDMap20261031_Stepsize open PGDMap20261031
Formal statement
theorem PGDMap20261031.optimal_constant_stepsizes : FullStepsizeTheorem := by sorry
Source
Optimal Constant Stepsizes for the Exact PGD Residual Curve, manuscript dated 2026-10-30, Theorem 1, pp. 1-2; local source: 02_PGD_Optimal_Constant_Stepsize.pdf