A piecewise linear programming algorithm for sparse signal reconstruction
From MaRDI portal
Publication:3132734
DOI10.1109/TST.2017.7830893zbMATH Open1389.94054OpenAlexW2580147525MaRDI QIDQ3132734FDOQ3132734
Authors: Kuangyu Liu, Xiangming Xi, Zhiming Xu, Shuning Wang
Publication date: 29 January 2018
Published in: Tsinghua Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tst.2017.7830893
Recommendations
- A linearly convergent algorithm for sparse signal reconstruction
- An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- A fast sparse signal recovery algorithm based on approximate \(l_0\) norm and hybrid optimization
- Sparse and robust signal reconstruction
Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cited In (12)
- PROMP: a sparse recovery approach to lattice-valued signals
- A linearly convergent algorithm for sparse signal reconstruction
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- Title not available (Why is that?)
- Piecewise sparse recovery via piecewise inverse scale space algorithm with deletion rule
- Piecewise sparse recovery in union of bases
- A matching pursuit algorithm of jointing optimization based on CGLS and LSQR
- A new smoothed L0 regularization approach for sparse signal recovery
- Covering point-sets with parallel hyperplanes and sparse signal recovery
- A maximum entropy function method for signal reconstruction in compressed sensing
- Effective zero-norm minimization algorithms for noisy compressed sensing
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
This page was built for publication: A piecewise linear programming algorithm for sparse signal reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132734)