Documentation

TR_LALM_theory.Theorem_2_9

theorem LALM.Run.lyapunovDescent {n m : ℕ} {f : EuclideanSpace ℝ (Fin n) → ℝ} {c : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin m)} {x₀ : EuclideanSpace ℝ (Fin n)} {multiplier₀ : EuclideanSpace ℝ (Fin m)} (h : EqualityConstrained.Regularity f c) (params : Parameters h x₀ multiplier₀) (run : Run f c (↑↑params.rho) (↑↑params.beta) x₀ multiplier₀) {N k : ℕ} (h_admissible : run.IsAdmissiblePrefix h N) (hk_pos : 1 ≤ k) (hk : k < N) :
lyapunov h params run (k + 1) ≤ lyapunov h params run k - ↑↑params.beta / 4 * ‖run.step k‖ ^ 2

Theorem 2.9 (1): on an admissible prefix, each positive-index Lyapunov step decreases by at least (params.beta / 4) * ‖run.step k‖ ^ 2.

theorem LALM.Run.lyapunovLowerBound_le {n m : ℕ} {f : EuclideanSpace ℝ (Fin n) → ℝ} {c : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin m)} {x₀ : EuclideanSpace ℝ (Fin n)} {multiplier₀ : EuclideanSpace ℝ (Fin m)} (h : EqualityConstrained.Regularity f c) (params : Parameters h x₀ multiplier₀) (run : Run f c (↑↑params.rho) (↑↑params.beta) x₀ multiplier₀) {N k : ℕ} (h_admissible : run.IsAdmissiblePrefix h N) (hk_pos : 1 ≤ k) (hk : k ≤ N) :
lyapunovLowerBound h params ≤ lyapunov h params run k

Theorem 2.9 (2): every positive-index Lyapunov value in an admissible prefix is at least the uniform Lyapunov lower bound.