On optimal solutions of the constrained ℓ 0 regularization and its penalty problem
From MaRDI portal
Publication:2965692
DOI10.1088/1361-6420/33/2/025010zbMath1360.65183arXiv1610.02125OpenAlexW3099238915MaRDI QIDQ2965692
Publication date: 3 March 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02125
Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25)
Related Items
On the local and global minimizers of $ \newcommand{\e}{{\rm e}} \ell_0$ gradient regularized model with box constraints for image restoration ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ 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 ⋮ Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ Alternating method based on framelet l0-norm and TV regularization for image restoration ⋮ One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method
Uses Software
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- 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
- Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
- Sparse Optimization with Least-Squares Constraints
- New convergence results for the scaled gradient projection method
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Convergence Analysis of Generalized Iteratively Reweighted Least Squares Algorithms on Convex Function Spaces
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- Sparse Approximate Solutions to Linear Systems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Adaptive greedy approximations
