Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer

DOI10.1137/11085476XzbMath1281.65092arXiv1304.5218OpenAlexW1964888939MaRDI QIDQ2873223

Publication date: 23 January 2014

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5218

zbMATH Keywords

algorithm quadratic programming numerical examples variational methods perturbation analysis global minimizers local minimizers sparse recovery $\ell_0$ regularization uniqueness of the solution strict minimizers underdetermined linear systems asymptotically level stable functions nonconvex nonsmooth minimization solution analysis

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (24)

Relationship between the optimal solutions of least squares regularized with $\ell_{0}$-norm and constrained by $k$-sparsity ⋮ Minimizers of sparsity regularized Huber loss function ⋮ Erratum: A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ A data-driven line search rule for support recovery in high-dimensional data analysis ⋮ A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ Proximal algorithm for minimization problems in $l_0$-regularization for nonlinear inverse problems ⋮ On the local and global minimizers of $ \newcommand{\e}{{\rm e}} \ell_0$ gradient regularized model with box constraints for image restoration ⋮ A primal dual active set with continuation algorithm for the $\ell^0$-regularized optimization problem ⋮ Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates ⋮ 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 ℓ ₀ regularization and its penalty problem ⋮ Disparity and optical flow partitioning using extended Potts priors ⋮ New insights on the optimality conditions of the $\ell_2-\ell_0$ minimization problem ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ Unnamed Item ⋮ An unbiased approach to compressed sensing ⋮ A general truncated regularization framework for contrast-preserving variational signal and image restoration: motivation and implementation ⋮ Sparse signal inversion with impulsive noise by dual spectral projected gradient method ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ $ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recovery ⋮ High-dimensional variable selection via low-dimensional adaptive learning ⋮ Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem

This page was built for publication: Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer