Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

DOI10.1109/TSP.2009.2026004zbMath1391.90489MaRDI QIDQ4570000

Stephane Canu, G. Gasso, Alain Rakotomamonjy

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (66)

Sparse high-dimensional fractional-norm support vector machine via DC programming ⋮ Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection ⋮ Tracking hedge funds returns using sparse clones ⋮ DC approximation approaches for sparse optimization ⋮ Sparse and robust normal and \(t\)-portfolios by penalized \(L_q\)-likelihood minimization ⋮ The non-convex sparse problem with nonnegative constraint for signal reconstruction ⋮ Scalable Algorithms for Large Competing Risks Data ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ Regularized quantile regression under heterogeneous sparsity with application to quantitative genetic traits ⋮ Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis ⋮ A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso ⋮ A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ Sparse and risk diversification portfolio selection ⋮ Genetic algorithm versus classical methods in sparse index tracking ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ Sparsity-Assisted Signal Smoothing ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ Data driven discovery of systems of ordinary differential equations using nonconvex multitask learning ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning ⋮ Open issues and recent advances in DC programming and DCA ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty ⋮ A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem ⋮ Algorithms for non-negatively constrained maximum penalized likelihood reconstruction in tomographic imaging ⋮ Non-convex Optimization via Strongly Convex Majorization-minimization ⋮ DC programming and DCA: thirty years of developments ⋮ Optimizing shrinkage curves and application in image denoising ⋮ Likelihood-Based Selection and Sharp Parameter Estimation ⋮ A reweighted nuclear norm minimization algorithm for low rank matrix recovery ⋮ Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms ⋮ Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates ⋮ Iterative reweighted noninteger norm regularizing SVM for gene expression data classification ⋮ Unnamed Item ⋮ Estimation of the parameters of a weighted nuclear norm model and its application in image denoising ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ Broken adaptive ridge regression and its asymptotic properties ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ Nonconvex sorted \(\ell_1\) minimization for sparse approximation ⋮ Image restoration via simultaneous sparse coding: where structured sparsity meets Gaussian scale mixture ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ Quantile-based portfolios: post-model-selection estimation with alternative specifications ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Lasso–type and Heuristic Strategies in Model Selection and Forecasting ⋮ Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem ⋮ Un-diversifying during crises: is it a good idea? ⋮ Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning ⋮ A review on restoration of seismic wavefields based on regularization and compressive sensing ⋮ On Lasso refitting strategies ⋮ EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ A non-convex algorithm framework based on DC programming and DCA for matrix completion ⋮ Learning sparse classifiers with difference of convex functions algorithms ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming ⋮ Entropy function-based algorithms for solving a class of nonconvex minimization problems ⋮ Constructing optimal sparse portfolios using regularization methods

This page was built for publication: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming