DC approximation approach for _0-minimization in compressed sensing

Recommendations

DC approximation approaches for sparse optimization
DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
An $l_1$-$l_p$ DC regularization method for compressed sensing
A successive convex approximation approach for sparse solutions of convex programs
Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing

Cites work

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
A DC Programming Approach for Finding Communities in Networks
A DC programming approach for feature selection in support vector machines learning
A bilinear formulation for vector sparsity optimization
An affine scaling methodology for best basis selection
Atomic Decomposition by Basis Pursuit
Compressed sensing
Concave programming for finding sparse solutions to problems with convex constraints
Concave programming for minimizing the zero-norm over polyhedral sets
Convex analysis approach to d. c. programming: Theory, algorithms and applications
DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
DC approximation approaches for sparse optimization
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Fast Sparse Representation Based on Smoothed ℓ0 Norm
Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
Highly Robust Error Correction byConvex Programming
Improved iteratively reweighted least squares for unconstrained smoothed $\ell_q$ minimization
Iteratively reweighted least squares minimization for sparse recovery
Learning sparse classifiers with difference of convex functions algorithms
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
One-step sparse estimates in nonconcave penalized likelihood models
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Reweighted $\ell_1$-minimization for sparse solutions to underdetermined linear systems
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Some sharp performance bounds for least squares regression with $L_1$ regularization
Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$
The Adaptive Lasso and Its Oracle Properties
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Uncertainty principles and ideal atomic decomposition
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(11)

An $l_1$-$l_p$ DC regularization method for compressed sensing
DC programming and DCA: thirty years of developments
Open issues and recent advances in DC programming and DCA
DC formulations and algorithms for sparse optimization problems
A successive convex approximation approach for sparse solutions of convex programs
Heuristics for Finding Sparse Solutions of Linear Inequalities
DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
DC approximation approaches for sparse optimization
Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
Sparse covariance matrix estimation by DCA-based algorithms
DC-Programming versus $\ell_0$-superiorization for discrete tomography

Describes a project that uses

Uses Software

PDCO

This page was built for publication: DC approximation approach for $\ell_0$-minimization in compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808067)