The sparsest solution of the union of finite polytopes via its nonconvex relaxation
From MaRDI portal
Publication:2311128
DOI10.1007/s00186-019-00660-2zbMath1425.90081OpenAlexW2915358250MaRDI QIDQ2311128
Yong Wang, Guowei You, Zheng-Hai Huang
Publication date: 10 July 2019
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-019-00660-2
Numerical mathematical programming methods (65K05) Convex programming (90C25) Control/observation systems with incomplete information (93C41)
Related Items
Cites Work
- Unnamed Item
- Sparse solutions of linear complementarity problems
- A mathematical introduction to compressive sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Lectures on Polytopes
- Sparse Approximate Solutions to Linear Systems
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
- Convex Analysis
