Bregman reweighted alternating minimization and its application to image deblurring

DOI10.1016/j.ins.2019.06.024zbMath1453.90129OpenAlexW2954353585MaRDI QIDQ2224931

Publication date: 4 February 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.06.024

zbMATH Keywords

convergence analysis Bregman distance deblurring semi-algebraic nonconvex and nonsmooth minimization reweighted alternating minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Uses Software

RecPF
LMaFit

Cites Work

Unnamed Item
Unnamed Item
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Little-$o$ convergence rates for several alternating minimization methods
Alternating direction method of multipliers with difference of convex functions
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Global convergence of proximal iteratively reweighted algorithm
Global convergence of ADMM in nonconvex nonsmooth optimization
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Coordinate descent algorithms
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
Alternating direction methods for classical and ptychographic phase retrieval
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Hard thresholding pursuit with continuation for ℓ⁰‐regularized minimizations
Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
Alternating direction method of multipliers for real and complex polynomial optimization models
On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

This page was built for publication: Bregman reweighted alternating minimization and its application to image deblurring