Equivalence of minimal _0- and _p -norm solutions of linear equalities, inequalities and linear programs for sufficiently small p
From MaRDI portal
Publication:650241
DOI10.1007/S10957-011-9871-XzbMATH Open1226.90104OpenAlexW2029275935MaRDI QIDQ650241FDOQ650241
Authors: Glenn Fung, O. 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
Recommendations
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Complementarity formulations of \(\ell_0\)-norm optimization
- A note on the complexity of \(L _{p }\) minimization
- Uniqueness conditions for the sparsest solution of linear systems
Cites Work
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Decoding by Linear Programming
- Convex Analysis
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Title not available (Why is that?)
- Minimum-support solutions of polyhedral concave programs*
- Parsimonious least norm approximation
- Title not available (Why is that?)
- Solution of general linear complementarity problems via nondifferentiable concave minimization
Cited In (21)
- Estimation of \(l_0\) norm penalized models: a statistical treatment
- Sparse identification of nonlinear dynamical systems via non-convex penalty least squares
- A note on the complexity of \(L _{p }\) minimization
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Title not available (Why is that?)
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Sparse approximation over the cube
- A smoothing method for sparse optimization over convex sets
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- 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 Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Sparse identification of dynamical systems by reweighted \(l_1\)-regularized least absolute deviation regression
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
This page was built for publication: Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650241)
