After (37) — positivity of the Armijo right-hand side
ProvedProjNewton.Superlinear.armijo_rhs_positivebound-constraintsnonlinear-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1projected-newton
Fix the paper's algorithm parameters and a feasible point . Let be symmetric positive definite and diagonal with respect to the enlarged set defined by (32). For every trial exponent , the right-hand side of (37) is nonnegative, and
This distinguishes a genuine descent step from a critical fixed point at every trial step.
Formalization Note The factor is retained in the stated right-hand side. The standing assumption, , feasibility and all parameter ranges are explicit. The displayed here denotes the iteration's enlarged set , not the smaller set (17).
Preamble
import Mathlib import Definitions.Def_ProjNewton_Superlinear_Algorithm
Formal statement
namespace ProjNewton.Superlinear
open Matrix Filter Topology
/-- Bertsekas (1982), after (37), p. 229. -/
theorem armijo_rhs_positive {n : ℕ} (hn : 0 < n) (f : Vec n → ℝ)
(hf : ContDiff ℝ 1 f) (μ : Fin n → ℝ) (ε β σ : ℝ)
(hpar : Params μ ε β σ) (x : Vec n) (hx : x ∈ orthant n)
(D : Matrix (Fin n) (Fin n) ℝ) (hD : D.PosDef)
(hdiag : DiagonalWrt D (Ik f μ ε x)) :
∀ m : ℕ, 0 ≤ σ * armijoRHS f μ ε D x (β ^ m) ∧
(0 < σ * armijoRHS f μ ε D x (β ^ m) ↔ ¬ IsCritical f x) := by sorry
end ProjNewton.Superlinear
Source
Bertsekas, Projected Newton Methods for Optimization Problems with Simple Constraints, SIAM J. Control Optim. 20(2) (1982), p. 229, §2 after (37)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.