Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring

DOI10.1007/S10444-016-9462-3zbMath1401.94014OpenAlexW1520995709MaRDI QIDQ2374376

Li-Juan Song, Yan Zhou, Dai-Qiang Chen

Publication date: 15 December 2016

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-016-9462-3

zbMATH Keywords

total variationimage deblurringprimal-dualadapted metricfixed point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of quasi-Newton type (90C53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (3)

Second order semi-smooth proximal Newton methods in Hilbert spaces ⋮ Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application ⋮ Globalized inexact proximal Newton-type methods for nonconvex composite functions

Uses Software

• LBFGS-B
• TwIST

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Operator splittings, Bregman methods and frame shrinkage in image processing
• A new TV-Stokes model with augmented Lagrangian method for image denoising and deconvolution
• Multiplicative denoising based on linearized alternating direction method using discrepancy function constraint
• A fast algorithm for the total variation model of image denoising
• An algorithm for total variation minimization and applications
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A fast fixed point algorithm for total variation deblurring and segmentation
• Proximity algorithms for the L1/TV image denoising model
• The Moreau envelope approach for the L1/TV image denoising model
• Regularized Generalized Inverse Accelerating Linearized Alternating Minimization Algorithm for Frame-Based Poissonian Image Deblurring
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• Proximity algorithms for image models: denoising
• The Baillon-Haddad Theorem Revisited
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Preconditioned alternating projection algorithms for maximum a posteriori ECT reconstruction
• A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models
• The Split Bregman Method for L1-Regularized Problems
• An EM algorithm for wavelet-based image restoration
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A Limited Memory Algorithm for Bound Constrained Optimization
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Signal Recovery by Proximal Forward-Backward Splitting
• Proximité et dualité dans un espace hilbertien
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Compressed sensing

This page was built for publication: Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring