Concave programming for finding sparse solutions to problems with convex constraints
From MaRDI portal
Publication:3096890
DOI10.1080/10556788.2010.511668zbMath1254.90179OpenAlexW2090959185MaRDI QIDQ3096890
Publication date: 15 November 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.511668
Related Items (6)
Sparse approximation over the cube ⋮ A smoothing method for sparse optimization over convex sets ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
Uses Software
Cites Work
- Unnamed Item
- Concave programming for minimizing the zero-norm over polyhedral sets
- Minimax estimation via wavelet shrinkage
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Atomic Decomposition by Basis Pursuit
- An EM algorithm for wavelet-based image restoration
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Ideal spatial adaptation by wavelet shrinkage
- Linear Programming
- 10.1162/153244303322753751
- Stable signal recovery from incomplete and inaccurate measurements
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Compressed sensing
This page was built for publication: Concave programming for finding sparse solutions to problems with convex constraints
