A maximum entropy function method for nonconvex optimization in compressed sensing
From MaRDI portal
Publication:4902089
zbMATH Open1265.94023MaRDI QIDQ4902089FDOQ4902089
Authors: Tianjing Wang, Zhen Yang, Baoyu Zheng
Publication date: 24 January 2013
Recommendations
- A maximum entropy function method for signal reconstruction in compressed sensing
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Convex feasibility modeling and projection methods for sparse signal recovery
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26) Measures of information, entropy (94A17)
Cited In (4)
- Convex feasibility modeling and projection methods for sparse signal recovery
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- On a computationally scalable sparse formulation of the multidimensional and nonstationary maximum entropy principle
- A maximum entropy function method for signal reconstruction in compressed sensing
This page was built for publication: A maximum entropy function method for nonconvex optimization in compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902089)