One-step conjugate-gradient energy contraction
ProvedVectorSpaceOpt.cg_energy_contractioncoercivityconjugate-gradientenergy-estimatelinear-contraction
Let xStar solve Q xStar = b, with Q self-adjoint and satisfying 0 < m ≤ M and the standard quadratic bounds. At any iteration whose search direction is nonzero, the guarded conjugate-gradient step contracts the quadratic error energy by the uniform factor 1 - m/M:
This is the estimate at the top of printed p. 296. The active-step premise ensures both recurrence denominators are justified; after exact termination the total sequence stutters at a solution and needs no contraction division. The lemma is the quantitative bridge from the recurrence invariants to norm convergence.
Preamble
import Definitions.Def_VectorSpaceOpt_conjugate_gradient
Formal statement
namespace VectorSpaceOpt
/-- Equation at the top of p. 296: the one-step energy contraction. -/
theorem cg_energy_contraction
{H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
(Q : H →L[ℝ] H) (b x₀ xStar : H) (m M : ℝ)
(hm : 0 < m) (hmM : m ≤ M) (hxStar : Q xStar = b)
(hself : IsRealSelfAdjoint Q) (hbounds : IsCoerciveBetween Q m M) :
∀ n : ℕ, (conjugateGradientIterate Q b x₀ n).p ≠ 0 →
conjugateGradientEnergy Q xStar (conjugateGradientIterate Q b x₀ (n + 1)).x ≤
(1 - m / M) *
conjugateGradientEnergy Q xStar (conjugateGradientIterate Q b x₀ n).x := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.8, energy estimate in the proof of Theorem 1, printed pp. 295–296 (physical PDF pp. 313–314). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf