An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * (Q5019920)

scientific article; zbMATH DE number 7455587

Language	Label	Description	Also known as
English	An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup>	scientific article; zbMATH DE number 7455587

Statements

instance of

scholarly article

0 references

title

An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * (English)

0 references

0 references

0 references

0 references

0 references

0 references

11 January 2022

0 references

zbMATH Keywords

$\ell_p$ regularization

0 references

Isoft algorithm

0 references

extrapolation

0 references

support shrinking

0 references

Kurdyka-Łojasiewicz property

0 references

wavelet frames

0 references

describes a project that uses

iPiano

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1088/1361-6420/ac38b8

0 references

cites work

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Image restoration by minimizing zero norm of wavelet frame coefficients

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Linearly Constrained Non-Lipschitz Optimization for Image Restoration

0 references

Iterative thresholding for sparse approximations

0 references

Iterative hard thresholding for compressed sensing

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Convergence analysis of tight framelet approach for missing data recovery

0 references

A framelet-based image inpainting algorithm

0 references

Simultaneous cartoon and texture inpainting

0 references

Split Bregman Methods and Frame Based Image Restoration

0 references

Q3071337

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

Complexity of unconstrained $L_2 - L_p$ minimization

0 references

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

0 references

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

0 references

Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization

0 references

Orthonormal bases of compactly supported wavelets

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Iteratively reweighted least squares minimization for sparse recovery

0 references

For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution

0 references

Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)

0 references

Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$

0 references

Q3995612

0 references

Splitting Methods in Communication, Imaging, Science, and Engineering

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

On gradients of functions definable in o-minimal structures

0 references

An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems

0 references

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization

0 references

A new globally convergent algorithm for non-Lipschitz $\ell_{p}-\ell_q$ minimization

0 references

Q5643297

0 references

Geometric categories and o-minimal structures

0 references

Iterative hard thresholding methods for $l_0$ regularized convex cone programming

0 references

Multiresolution Approximations and Wavelet Orthonormal Bases of L 2 (R)

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Q3320132

0 references

Gradient methods for minimizing composite functions

0 references

Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

Affine systems in $L_ 2(\mathbb{R}^d)$: The analysis of the analysis operator

0 references

Q3096719

0 references

Zero norm based analysis model for image smoothing and reconstruction

0 references

Image decomposition via the combination of sparse representations and a variational approach

0 references

Recovery of sparsest signals via $\ell^q $-minimization

0 references

Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems

0 references

Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models

0 references

An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration

0 references

Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction

0 references

A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal

0 references

Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization

0 references

Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming

0 references

Identifiers

zbMATH Open document ID

1483.90125

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1088/1361-6420/AC38B8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5019920

An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920)

Statements

Identifiers

Sitelinks

Mathematics(1 entry)