Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
From MaRDI portal
Publication:742293
DOI10.1007/s10589-013-9553-8zbMath1326.90062OpenAlexW2120032870MaRDI QIDQ742293
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
global convergencenonsmooth optimizationnonconvex optimizationstationary points\(\ell_p\) minimizationpseudo-convex
Related Items (45)
Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ Non-convex TV denoising corrupted by impulse noise ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem ⋮ A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal ⋮ A joint matrix minimization approach for multi-image face recognition ⋮ Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ Smoothing strategy along with conjugate gradient algorithm for signal reconstruction ⋮ A globally convergent algorithm for a constrained non-Lipschitz image restoration model ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ A smoothing method for sparse optimization over convex sets ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Image denoising using combined higher order non-convex total variation with overlapping group sparsity ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Bregman reweighted alternating minimization and its application to image deblurring ⋮ On constrained optimization with nonconvex regularization ⋮ On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)] ⋮ Non-convex ℓp regularization for sparse reconstruction of electrical impedance tomography ⋮ Iterative reweighted methods for \(\ell _1-\ell _p\) minimization ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ A gradient descent based algorithm for \(\ell_p\) minimization ⋮ Nonconvex sorted \(\ell_1\) minimization for sparse approximation ⋮ A residual-based algorithm for solving a class of structured nonsmooth optimization problems ⋮ 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 ⋮ Non-Lipschitz Models for Image Restoration with Impulse Noise Removal ⋮ On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * ⋮ Entropy function-based algorithms for solving a class of nonconvex minimization problems ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Cites Work
- A note on the complexity of \(L _{p }\) minimization
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
- Smoothing methods for nonsmooth, nonconvex minimization
- Sample size selection in optimization methods for machine learning
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- 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
- Restricted isometry properties and nonconvex compressive sensing
- Optimizing Condition Numbers
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Optimization and nonsmooth analysis
- L 1/2 regularization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Sparse Signal Reconstruction via Iterative Support Detection
This page was built for publication: Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
