Convergence of the reweighted _1 minimization algorithm for _2-_p minimization
From MaRDI portal
Publication:742293
DOI10.1007/S10589-013-9553-8zbMATH Open1326.90062OpenAlexW2120032870MaRDI QIDQ742293FDOQ742293
Authors: Xiaojun Chen, Weijun Zhou 
Publication date: 18 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9553-8
Recommendations
- Sparse recovery by the iteratively reweighted \(\ell_1\) algorithm for elastic \(\ell_2-\ell_q\) minimization
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- scientific article; zbMATH DE number 6747340
nonconvex optimizationglobal convergencenonsmooth optimizationstationary points\(\ell_p\) minimizationpseudo-convex
Cites Work
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sample size selection in optimization methods for machine learning
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Smoothing methods for nonsmooth, nonconvex minimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Optimization and nonsmooth analysis
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Restricted isometry properties and nonconvex compressive sensing
- L 1/2 regularization
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- A note on the complexity of \(L _{p }\) minimization
- Sparse signal reconstruction via iterative support detection
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Optimizing condition numbers
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
Cited In (51)
- Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
- Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization
- A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Sparse recovery by the iteratively reweighted \(\ell_1\) algorithm for elastic \(\ell_2-\ell_q\) minimization
- Non-Lipschitz models for image restoration with impulse noise removal
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- On constrained optimization with nonconvex regularization
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- A joint matrix minimization approach for multi-image face recognition
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- A gradient descent based algorithm for \(\ell_p\) minimization
- A solution approach for cardinality minimization problem based on fractional programming
- Global convergence of proximal iteratively reweighted algorithm
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images
- Image retinex based on the nonconvex TV-type regularization
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model
- Non-convex TV denoising corrupted by impulse noise
- A smoothing method for sparse optimization over convex sets
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Bregman reweighted alternating minimization and its application to image deblurring
- Image denoising using combined higher order non-convex total variation with overlapping group sparsity
- Non-convex \(\ell_p\) regularization for sparse reconstruction of electrical impedance tomography
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- A new computational method for the sparsest solutions to systems of linear equations
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
This page was built for publication: Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742293)
