Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
From MaRDI portal
Publication:285544
DOI10.1016/j.acha.2015.10.010zbMath1338.90323OpenAlexW2259236698MaRDI QIDQ285544
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
parameter selectionsparse recovery\(\ell_0\)-regularization\(k\)-sparsity constraintglobally optimal solutionsoptimal solution analysisquasi-equivalence between nonconvex problemsunder-determined linear systems
Related Items
Constant along primal rays conjugacies and the l0 pseudonorm, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, On the local and global minimizers of $ \newcommand{\e}{{\rm e}} \ell_0$ gradient regularized model with box constraints for image restoration, Capra-convexity, convex factorization and variational formulations for the \(\ell_0\) pseudonorm, Solution sets of three sparse optimization problems for multivariate regression, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, On optimal solutions of the constrained ℓ 0 regularization and its penalty problem, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, An unbiased approach to compressed sensing, Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to model selection and sparse recovery using regularized least squares
- Survey of multi-objective optimization methods for engineering
- Phase transitions for greedy sparse approximation algorithms
- Iterative thresholding meets free-discontinuity problems
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- 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
- Compressed sensing and best 𝑘-term approximation
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Sparse Optimization with Least-Squares Constraints
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Reconstruction From Noisy Random Projections
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Variational Analysis
- Generalized Inverses and Ranks of Block Matrices
- Combined SVM-based feature selection and classification
- Compressed sensing
