Lemma 2.5 — every CW-minimum of (P) is a basic feasible vector
ProvedSparseNLO.CWOpt.lemma_2_5Let be continuously differentiable and bounded below (Assumption 1), and let be an integer. Consider the sparsity constrained problem .
If is a coordinate-wise minimum of (P) (Definition 2.4), then is a basic feasible vector (Definition 2.1):
The lemma says that the coordinate-wise optimality condition is at least as strong as basic feasibility. In the proof of Theorem 2.4 it supplies the vanishing of the gradient on the support, (2.14).
Formalization Note Assumption 1 (a lower bound ) is the paper's standing assumption and is kept as a hypothesis, although the statement does not need it. The hypothesis repeats the feasibility built into the definition of a CW-minimum, as the page does.
import Mathlib import Definitions.Def_SparseNLO_CWOpt_Setting
namespace SparseNLO.CWOpt
/-- Lemma 2.5 (p. 10): every CW-minimum of (P) is a BF vector. -/
theorem lemma_2_5 {n s : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f)
(hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x) (hs : 0 < s) (hsn : s < n)
(xstar : EuclideanSpace ℝ (Fin n)) (hx : xstar ∈ Cs n s) (hcw : IsCWMin f s xstar) :
IsBF f s xstar := by sorry
end SparseNLO.CWOpt
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.