A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
From MaRDI portal
Publication:1729942
DOI10.1007/s11425-017-9315-9zbMath1409.90188OpenAlexW2904642251WikidataQ128834279 ScholiaQ128834279MaRDI QIDQ1729942
Qian Li, Chang Jun Yu, Yan-Qin Bai, Ya-Xiang Yuan
Publication date: 7 March 2019
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-017-9315-9
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection ⋮ Sparse and risk diversification portfolio selection ⋮ A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm ⋮ A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing ⋮ A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images ⋮ Weighted thresholding homotopy method for sparsity constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Introductory lectures on convex optimization. A basic course.
- Least angle regression. (With discussion)
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iteratively reweighted least squares minimization for sparse recovery
- Image compression through wavelet transform coding
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- L 1/2 regularization
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Proximité et dualité dans un espace hilbertien
- Compressed sensing
This page was built for publication: A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
