Relationship between the optimal solutions of least squares regularized with _0-norm and constrained by k-sparsity

DOI10.1016/J.ACHA.2015.10.010zbMATH Open1338.90323OpenAlexW2259236698MaRDI QIDQ285544FDOQ285544

Publication date: 19 May 2016

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2015.10.010

Recommendations

On optimal solutions of the constrained ${\ell}_{0}$ regularization and its penalty problem
Uniqueness conditions for the sparsest solution of linear systems
Sparse solutions of a class of constrained optimization problems
Sparse regularization with the ℓ0 norm
Description of the minimizers of least squares regularized with $\ell_0$-norm. Uniqueness of the global minimizer

zbMATH Keywords

sparse recovery $\ell_0$-regularization $k$-sparsity constraint globally optimal solutions optimal solution analysis parameter selection quasi-equivalence between nonconvex problems under-determined linear systems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

Sparse Optimization with Least-Squares Constraints
A unified approach to model selection and sparse recovery using regularized least squares
Variational Analysis
Title not available (Why is that?)
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Title not available (Why is that?)
Generalized Inverses and Ranks of Block Matrices
Just relax: convex programming methods for identifying sparse signals in noise
Title not available (Why is that?)
Statistical challenges with high dimensionality: feature selection in knowledge discovery
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Compressed sensing
Title not available (Why is that?)
Iterative hard thresholding for compressed sensing
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
An efficient algorithm for $\ell_{0}$ minimization in wavelet frame based image restoration
Compressed sensing and best $k$-term approximation
Title not available (Why is that?)
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Survey of multi-objective optimization methods for engineering
Title not available (Why is that?)
Iterative thresholding for sparse approximations
Phase transitions for greedy sparse approximation algorithms
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
Description of the minimizers of least squares regularized with $\ell_0$-norm. Uniqueness of the global minimizer
A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
Optimization by stochastic continuation
A continuous exact $\ell_0$ penalty (CEL0) for least squares regularized problem
Signal Reconstruction From Noisy Random Projections
Combined SVM-based feature selection and classification
Iterative thresholding meets free-discontinuity problems

Cited In (13)

An unbiased approach to compressed sensing
On optimal solutions of the constrained ${\ell}_{0}$ regularization and its penalty problem
A review on the adaptive-ridge algorithm with several extensions
A unified view of exact continuous penalties for $\ell_2$-$\ell_0$ minimization
New insights on the optimality conditions of the $\ell_2-\ell_0$ minimization problem
Solution sets of three sparse optimization problems for multivariate regression
A continuous relaxation of the constrained $\ell_2-\ell_0$ problem
Optimality conditions for locally Lipschitz optimization with $l_0$-regularization
On the local and global minimizers of $\ell_0$ gradient regularized model with box constraints for image restoration
Capra-convexity, convex factorization and variational formulations for the $\ell_0$ pseudonorm
A nonlocal weighted difference of anisotropic and isotropic total variation to regularize partition boundaries in an image
Constant along primal rays conjugacies and the l₀ pseudonorm
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems

Uses Software

SPGL1
CoSaMP

This page was built for publication: Relationship between the optimal solutions of least squares regularized with $\ell_{0}$-norm and constrained by $k$-sparsity

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