Iterative reweighted methods for _1- _p minimization
From MaRDI portal
Publication:1753073
DOI10.1007/S10589-017-9977-7zbMATH Open1401.90228OpenAlexW2781573027MaRDI QIDQ1753073FDOQ1753073
Authors: Xianchao Xiu, Lingchen Kong, Yan Li, Houduo 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
Recommendations
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- scientific article; zbMATH DE number 6276219
- Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Iteratively reweighted least squares minimization for sparse recovery
lower bound\(\ell _1-\ell _p\) minimizationgeneralized first-order stationary pointiterative reweighted \(\ell _1\)iterative reweighted \(\ell _2\) method
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- Adaptive robust variable selection
- Decoding by Linear Programming
- Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
- 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
- The \(L_1\) penalized LAD estimator for high dimensional linear regression
- Compressed sensing
- Smoothing methods for nonsmooth, nonconvex minimization
- Sparse Reconstruction by Separable Approximation
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Complexity of unconstrained \(L_2 - L_p\) minimization
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Iteratively reweighted least squares minimization for sparse recovery
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Penalized Composite Quasi-Likelihood for Ultrahigh Dimensional Variable Selection
- A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty
- Rank-min-one and sparse tensor decomposition for surveillance video
Cited In (21)
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- A fast and effective algorithm for sparse linear regression with \(\ell_p\)-norm data fidelity and elastic net regularization
- Properties of \(\ell_p\)-norm errors in signal recovery
- A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- An efficient non-convex total variation approach for image deblurring and denoising
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- A Globally Convergent Method for $l_p $ Problems
- Title not available (Why is that?)
- A Laplacian approach to \(\ell_1\)-norm minimization
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- An efficient semismooth Newton method for adaptive sparse signal recovery problems
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
This page was built for publication: Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753073)
