Bregman reweighted alternating minimization and its application to image deblurring

DOI10.1016/J.INS.2019.06.024MaRDI QIDQ2224931zbMATH OpenOpenAlexFDO

Authors Tao Sun, Linbo Qiao, Dongsheng Li

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

Bregman distanceconvergence analysisdeblurringnonconvex and nonsmooth minimizationreweighted alternating minimizationsemi-algebraic

Mathematics Subject Classification ID

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

Recommendations

• Alternating split Bregman method for the bilaterally constrained image deblurring problem
• A new reweighted minimization algorithm for image deblurring
• Inertial Nonconvex Alternating Minimizations for the Image Deblurring
• Linearized Bregman Iterations for Frame-Based Image Deblurring
• A Bregman iterative regularization method for wavelet-based image deblurring
• Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
• Split Bregman iteration algorithm for total bounded variation regularization based image deblurring
• Bound alternative direction optimization for image deblurring
• Blind image deblurring via the weighted Schatten p-norm minimization prior
• \(L^1\)-regularized inverse problems for image deblurring via bound- and equality-constrained optimization

Cites work

• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Alternating direction method of multipliers for real and complex polynomial optimization models
• Alternating direction method of multipliers with difference of convex functions
• Alternating direction methods for classical and ptychographic phase retrieval
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• Coordinate descent algorithms
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Global convergence of proximal iteratively reweighted algorithm
• Global convergence of splitting methods for nonconvex composite optimization
• Hard thresholding pursuit with continuation for \(\ell^{0}\)-regularized minimizations
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
• Little-o convergence rates for several alternating minimization methods
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
• On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives

Cited in

(4)

• A new reweighted minimization algorithm for image deblurring
• On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
• A Bayesian approach to total least-squares in perturbed compressive sensing
• Alternating split Bregman method for the bilaterally constrained image deblurring problem

Describes a project that uses

Uses Software

• RecPF
• LMaFit

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224931)