Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
From MaRDI portal
Publication:1753073
DOI10.1007/s10589-017-9977-7zbMath1401.90228OpenAlexW2781573027MaRDI QIDQ1753073
Lingchen Kong, Xianchao Xiu, Yan Li, Hou-Duo Qi
Publication date: 25 May 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9977-7
lower bound\(\ell _1-\ell _p\) minimizationgeneralized first-order stationary pointiterative reweighted \(\ell _1\)iterative reweighted \(\ell _2\) method
Related Items (2)
An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ An efficient non-convex total variation approach for image deblurring and denoising
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- The \(L_1\) penalized LAD estimator for high dimensional linear regression
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Adaptive robust variable selection
- 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
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iteratively reweighted least squares minimization for sparse recovery
- Sparse Reconstruction by Separable Approximation
- Penalized Composite Quasi-Likelihood for Ultrahigh Dimensional Variable Selection
- Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Compressed sensing
This page was built for publication: Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
