A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images
DOI10.1007/s10878-019-00479-xzbMath1482.90169OpenAlexW2988409276MaRDI QIDQ2060052
Qian Li, Yan-Qin Bai, Xue-Rui Gao
Publication date: 13 December 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00479-x
optimality conditionssparse optimizationhybrid \(L_2\)-\(L_p\) regularizationimage recovery and deblurringmagnetic resonance brain images
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- A note of reduced dimension optimization algorithm of assignment problem
- Quadratic kernel-free least squares support vector machine for target diseases classification
- A two-stage method for member selection of emergency medical service
- How patient compliance impacts the recommendations for colorectal cancer screening
- A surgical scheduling method considering surgeons' preferences
- Lasso-type recovery of sparse representations for high-dimensional data
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- An integrated method to solve the healthcare facility layout problem under area constraints
- Three-sided stable matching problem with two of them as cooperative partners
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- Complexity of unconstrained \(L_2 - L_p\) minimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Decoding by Linear Programming
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- Compressed sensing
This page was built for publication: A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images