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

Cited in

(81)

Sparse high-dimensional fractional-norm support vector machine via DC programming
Tracking hedge funds returns using sparse clones
Regularized quantile regression under heterogeneous sparsity with application to quantitative genetic traits
A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
Global convergence of proximal iteratively reweighted algorithm
Genetic algorithm versus classical methods in sparse index tracking
Smoothed _1-regularization-based line search for sparse signal recovery
A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
Algorithms for non-negatively constrained maximum penalized likelihood reconstruction in tomographic imaging
DC programming and DCA: thirty years of developments
Broken adaptive ridge regression and its asymptotic properties
Image restoration via simultaneous sparse coding: where structured sparsity meets Gaussian scale mixture
An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
Optimizing shrinkage curves and application in image denoising
Estimation of the parameters of a weighted nuclear norm model and its application in image denoising
A unified primal dual active set algorithm for nonconvex sparse recovery
Quantile-based portfolios: post-model-selection estimation with alternative specifications
Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
A reweighted nuclear norm minimization algorithm for low rank matrix recovery
Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
Feature selection in SVM via polyhedral \(k\)-norm
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
Un-diversifying during crises: is it a good idea?
On Lasso refitting strategies
A general double-proximal gradient algorithm for d.c. programming
A non-convex algorithm framework based on DC programming and DCA for matrix completion
Constructing optimal sparse portfolios using regularization methods
Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis
Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
Nonconvex sorted \(\ell_1\) minimization for sparse approximation
Entropy function-based algorithms for solving a class of nonconvex minimization problems
DC approximation approach for \(\ell_0\)-minimization in compressed sensing
Lasso–type and Heuristic Strategies in Model Selection and Forecasting
Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
Learning sparse classifiers with difference of convex functions algorithms
A review on restoration of seismic wavefields based on regularization and compressive sensing
A continuous exact _0 penalty (CEL0) for least squares regularized problem
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
scientific article; zbMATH DE number 6982301 (Why is no real title available?)
A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging
Likelihood-based selection and sharp parameter estimation
Scalable Algorithms for Large Competing Risks Data
Non-convex optimization via strongly convex majorization-minimization
Incremental majorization-minimization optimization with application to large-scale machine learning
Difference-of-convex learning: directional stationarity, optimality, and sparsity
Sparsity-assisted signal smoothing
A unified view of exact continuous penalties for _2-_0 minimization
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
Penalty and augmented Lagrangian methods for constrained 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
On Algorithms for Difference of Monotone Operators
On algorithms for difference of monotone operators
Sparse and risk diversification portfolio selection
Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
Data driven discovery of systems of ordinary differential equations using nonconvex multitask learning
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
Open issues and recent advances in DC programming and DCA
Solve exactly an under determined linear system by minimizing least squares regularized with an _0 penalty
On the rate of convergence of the difference-of-convex algorithm (DCA)
Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
Extrapolated hard thresholding algorithms with finite length for composite _0 penalized problems
Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
Quaternion tensor low-rank approximation using a family of non-convex norms
General inertial proximal DC algorithm for three block nonsmooth DC optimization problems
A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation
First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
An accelerated double-proximal gradient algorithm for DC programming
A new framework for compressed sensing by p-concave functions
Alternating direction method of multipliers with difference of convex functions
A Bayesian approach to total least-squares in perturbed compressive sensing
A full splitting algorithm for structured difference-of-convex programs
Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
Inertial Bregman proximal iteratively reweighted algorithms for a class of nonconvex nonsmooth regularized problems
Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm

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

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