Equivalence of minimal _0- and _p -norm solutions of linear equalities, inequalities and linear programs for sufficiently small p
From MaRDI portal
Publication:650241
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
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- Convex Analysis
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Minimum-support solutions of polyhedral concave programs*
- Parsimonious least norm approximation
- Solution of general linear complementarity problems via nondifferentiable concave minimization
Cited in
(25)- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Estimation of \(l_0\) norm penalized models: a statistical treatment
- An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Sparse identification of nonlinear dynamical systems via non-convex penalty least squares
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- A smoothing method for sparse optimization over polyhedral sets
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Sparse approximation over the cube
- A smoothing method for sparse optimization over convex sets
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- A note on the complexity of \(L _{p }\) minimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Minimal zero norm solutions of linear complementarity problems
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation
- scientific article; zbMATH DE number 7626727 (Why is no real title available?)
- Complementarity formulations of \(\ell_0\)-norm optimization
- Sparse identification of dynamical systems by reweighted \(l_1\)-regularized least absolute deviation regression
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)
