DC Approximation Approach for ℓ0-minimization in Compressed Sensing
From MaRDI portal
Publication:2808067
DOI10.1007/978-3-319-17996-4_4zbMath1406.94010OpenAlexW970818482MaRDI QIDQ2808067
Nguyên Thị Bích Thủy, Hoai An Le Thi, Hoai Minh Le, Xuan Thanh Vo
Publication date: 26 May 2016
Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_4
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (5)
Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Open issues and recent advances in DC programming and DCA ⋮ DC programming and DCA: thirty years of developments ⋮ DC formulations and algorithms for sparse optimization problems ⋮ Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
Uses Software
Cites Work
- The Adaptive Lasso and Its Oracle Properties
- DC approximation approaches for sparse optimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- One-step sparse estimates in nonconcave penalized likelihood models
- A bilinear formulation for vector sparsity optimization
- Concave programming for minimizing the zero-norm over polyhedral sets
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A DC programming approach for feature selection in support vector machines learning
- An affine scaling methodology for best basis selection
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Learning sparse classifiers with difference of convex functions algorithms
- Concave programming for finding sparse solutions to problems with convex constraints
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Highly Robust Error Correction byConvex Programming
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- Iteratively reweighted least squares minimization for sparse recovery
- Atomic Decomposition by Basis Pursuit
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Uncertainty principles and ideal atomic decomposition
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- A DC Programming Approach for Finding Communities in Networks
- Compressed sensing
This page was built for publication: DC Approximation Approach for ℓ0-minimization in Compressed Sensing
