Lemma 3.1 — the projected gradient is a steepest descent direction
ProvedCalamaiMore.Convergence.projGrad_propertiesp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projected-gradientstationary-pointtangent-cone
Let be a nonempty closed convex subset of a finite-dimensional real inner product space , continuously differentiable on , , the tangent cone of at and the projected gradient. Then:
- ;
- the minimum below is attained and
- is a stationary point of if and only if .
Part 2 shows that is a steepest descent direction for relative to ; part 3 makes a measure of stationarity.
Formalization Note The minimum of part 2 is stated as IsLeast of the set of values , which asserts attainment.
Preamble
import Mathlib import Definitions.Def_CalamaiMore_Convergence_projGrad import Definitions.Def_CalamaiMore_Shared_IsStationaryPoint
Formal statement
namespace CalamaiMore.Convergence
/-- Calamai–Moré, Lemma 3.1 (p. 102): (a) `-⟨∇f(x), ∇_Ω f(x)⟩ = ‖∇_Ω f(x)‖²`;
(b) `min {⟨∇f(x), v⟩ : v ∈ T(x), ‖v‖ ≤ 1} = -‖∇_Ω f(x)‖` (the minimum is attained);
(c) `x` is a stationary point iff `∇_Ω f(x) = 0`. -/
theorem projGrad_properties {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E]
(Ω : Set E) (hΩne : Ω.Nonempty) (hΩc : IsClosed Ω) (hΩcv : Convex ℝ Ω)
(f : E → ℝ) (hfd : ∀ x ∈ Ω, DifferentiableAt ℝ f x) (hfc : ContinuousOn (gradient f) Ω)
(x : E) (hx : x ∈ Ω) :
-inner ℝ (gradient f x) (projGrad f Ω x) = ‖projGrad f Ω x‖ ^ 2 ∧
IsLeast {r : ℝ | ∃ v ∈ CalamaiMore.Shared.tangentCone Ω x, ‖v‖ ≤ 1 ∧ r = inner ℝ (gradient f x) v}
(-‖projGrad f Ω x‖) ∧
(CalamaiMore.Shared.IsStationaryPoint f Ω x ↔ projGrad f Ω x = 0) := by sorry
end CalamaiMore.Convergence
Source
Calamai & Moré, Projected gradient methods for linearly constrained problems, Math. Programming 39 (1987), p. 102, Lemma 3.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.