Relationship between the optimal solutions of least squares regularized with _0-norm and constrained by k-sparsity
From MaRDI portal
Publication:285544
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
Cites work
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- A unified approach to model selection and sparse recovery using regularized least squares
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Combined SVM-based feature selection and classification
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Description of the minimizers of least squares regularized with \(\ell_0\)-norm. Uniqueness of the global minimizer
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Generalized Inverses and Ranks of Block Matrices
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Iterative thresholding meets free-discontinuity problems
- Just relax: convex programming methods for identifying sparse signals in noise
- Optimization by stochastic continuation
- Phase transitions for greedy sparse approximation algorithms
- Signal Reconstruction From Noisy Random Projections
- Sparse Optimization with Least-Squares Constraints
- Statistical challenges with high dimensionality: feature selection in knowledge discovery
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Survey of multi-objective optimization methods for engineering
- Variational Analysis
Cited in
(13)- Capra-convexity, convex factorization and variational formulations for the \(\ell_0\) pseudonorm
- Constant along primal rays conjugacies and the l0 pseudonorm
- Solution sets of three sparse optimization problems for multivariate regression
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
- A review on the adaptive-ridge algorithm with several extensions
- On the local and global minimizers of \(\ell_0\) gradient regularized model with box constraints for image restoration
- An unbiased approach to compressed sensing
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- A nonlocal weighted difference of anisotropic and isotropic total variation to regularize partition boundaries in an image
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization
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)
