A rational enclosure for polynomial-curvature geometry design
OpenPGDRevision20261113.polynomial_certified_parameter_enclosurebregman-geometryconvex-optimizationformalization
On let , , and for . Thus
Use exact rational candidate and contacts with squared radii and signs .
The candidate has a global envelope and signed contact lower bound . The full feasible family has a unique minimizing pair with
Every improving pair with norm at most obeys that box and lower rate bound. Its exponent is also at most , so restricting the localization argument to loses no improving pair. The actual implicit updates are well-defined and for every feasible fixed pair and finite .
Related results. Parameter localization (Theorem 7.1) · Certified localization constants · Rational scale endpoints · polynomial global envelope certificate
Preamble
import Definitions.Def_PGDRevision20261113_NumericalCertificates open PGDRevision20261113
Formal statement
theorem PGDRevision20261113.polynomial_certified_parameter_enclosure : PolynomialNumericalEnclosureClaim := by sorry
Source
Author manuscript, Exact Residual Bounds and Optimal Geometry Selection for Proximal Gradient Methods, revised reading edition, 13 November 2026; Reproducibility supplement, polynomial geometry certificate; reproducibility/certify_geometry.py, polynomial_certificate; results/polynomial_geometry_certificate.json.