Appendix A, p. 20 — for an M-matrix, yᵏ is feasible, yᵏ ≤ ψ, for all k ≥ 2
ProvedPDASNewton.MMatrix.y_le_psiactive-setfeasibilitym-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an M-matrix, , , and let be a run of the primal-dual active set algorithm from arbitrary initial data. Then
Primal feasibility from the second iterate on is the second ingredient of Theorem 3.2.
Formalization Note The index bound is the paper's; can fail.
Preamble
import Mathlib import Definitions.Def_PDASNewton_MMatrix_Setting open Filter Topology Matrix
Formal statement
namespace PDASNewton.MMatrix
theorem y_le_psi {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (f ψ : Fin n → ℝ) (c : ℝ)
(hc : 0 < c) (hA : IsMMatrix A) (y lam : ℕ → Fin n → ℝ) (hrun : PDASNewton.Local.IsRun A f ψ c y lam) :
∀ k, 2 ≤ k → y k ≤ ψ := by sorry
end PDASNewton.MMatrix
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, p. 20, Appendix A, proof of Theorem 3.2, second paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.