A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing
DOI10.3934/jimo.2021211OpenAlexW4205918144MaRDI QIDQ2691208
Shu-Cherng Fang, Qian Li, Jian Luo, Yan-Qin Bai, Xue-Rui Gao
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2021211
image processingoptimality conditionssparse optimizationhybrid of the \(l_p\) quasi-norm and \(l_2\) norm
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Sparse microwave imaging: principles and applications
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- Lasso-type recovery of sparse representations for high-dimensional data
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- The risk inflation criterion for multiple regression
- A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images
- A gradient descent based algorithm for \(\ell_p\) minimization
- Robust and sparse portfolio model for index tracking
- An efficient algorithm for non-convex sparse optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Image compression through wavelet transform coding
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Regularization via Convex Analysis
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Compressed sensing
This page was built for publication: A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing
