Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
From MaRDI portal
Publication:650241
DOI10.1007/s10957-011-9871-xzbMath1226.90104OpenAlexW2029275935MaRDI QIDQ650241
Glenn M. Fung, Olvi L. Mangasarian
Publication date: 25 November 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9871-x
Related Items
A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays ⋮ Sparse approximation over the cube ⋮ A smoothing method for sparse optimization over convex sets ⋮ Sparse identification of dynamical systems by reweighted \(l_1\)-regularized least absolute deviation regression ⋮ A Smoothing Method for Sparse Optimization over Polyhedral Sets ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ Unnamed Item ⋮ The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement ⋮ Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems ⋮ On finding a generalized lowest rank solution to a linear semi-definite feasibility problem ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation ⋮ Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Parsimonious least norm approximation
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- Decoding by Linear Programming
- Minimum-support solutions of polyhedral concave programs*
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Convex Analysis
