Proposition 2.1, p. 7 — SOL(A,b,σ,p,1) is finite for each 0 < p < 1, and so is ⋃_{0<p<1} SOL(A,b,σ,p,1)
ProvedSparseLpLq.SmallP.proposition_2_1lp-minimizationnonconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization
Assume the blanket assumptions of the paper for : , and . Then
- for every the optimal solution set of problem (1.4), s.t. , is a finite set; and
- the union over all exponents in is a finite set:
No condition on is required. The second clause is the compactness substitute in the proof of Theorem 2.2: along any sequence , optimal solutions can take only finitely many values.
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_SparseLpLq_SmallP_Setting open scoped ENNReal Matrix
Formal statement
namespace SparseLpLq.SmallP
theorem proposition_2_1 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (σ : ℝ)
(hσ : 0 ≤ σ) (hfeas : (FEA A b σ 1).Nonempty) (hb : σ < qNorm 1 b) :
(∀ p ∈ Set.Ioo (0 : ℝ) 1, (SOL A b σ p 1).Finite) ∧
(⋃ p ∈ Set.Ioo (0 : ℝ) 1, SOL A b σ p 1).Finite := by sorry
end SparseLpLq.SmallP
Source
Yang, Chen & Xiang, Sparse solutions of a class of constrained optimization problems, arXiv:1907.00880v5, p. 7, Proposition 2.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.