Concave programming for finding sparse solutions to problems with convex constraints
From MaRDI portal
Recommendations
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Concave programming for minimizing the zero-norm over polyhedral sets
- Sparsity constrained optimization problems via disjunctive programming
- A successive convex approximation approach for sparse solutions of convex programs
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
Cites work
- 10.1162/153244303322753751
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- An EM algorithm for wavelet-based image restoration
- Atomic decomposition by basis pursuit
- Compressed sensing
- Concave programming for minimizing the zero-norm over polyhedral sets
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Ideal spatial adaptation by wavelet shrinkage
- Linear Programming
- Minimax estimation via wavelet shrinkage
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable signal recovery from incomplete and inaccurate measurements
Cited in
(16)- Dynamic programming with convexity, concavity and sparsity
- Tree-sparse convex programs
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- Convex optimization under combinatorial sparsity constraints
- A smoothing method for sparse optimization over convex sets
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- Convergence analysis of penalty decomposition algorithm for cardinality constrained convex optimization in Hilbert spaces
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Algorithms for sparsity-constrained optimization
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Restricted normal cones and sparsity optimization with affine constraints
- Algorithm 813
- Sparse approximation over the cube
- Sparse convex optimization toolkit: a mixed-integer framework
- A Path-Based Approach to Constrained Sparse Optimization
This page was built for publication: Concave programming for finding sparse solutions to problems with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096890)
