Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization
From MaRDI portal
Publication:2230788
DOI10.1007/s11590-020-01685-xzbMath1477.90106MaRDI QIDQ2230788
Hao Wang, Hao Zeng, Qiong Wu, Jiashan Wang
Publication date: 28 September 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01685-x
nonconvex regularization; iteratively reweighted algorithm; \(\ell_p\)-norm regularization; maximum a posterior; non-Lipschitz differentiable
90C30: Nonlinear programming
Related Items
An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Local linear convergence of proximal coordinate descent algorithm, Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A note on the complexity of \(L _{p }\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Global convergence of proximal iteratively reweighted algorithm
- A proximal difference-of-convex algorithm with extrapolation
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- On Fej\'er monotone sequences and nonexpansive mappings
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Optimality conditions for the constrainedLp-regularization
- Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Bayesian Compressive Sensing Using Laplace Priors
- Sparse Logistic Regression with Lp Penalty for Biomarker Identification
