Two modified schemes for the primal dual fixed point method

DOI10.4208/CSIAM-AM.2020-0042MaRDI QIDQ6941329zbMATH OpenFDO

Authors Ya-Nan Zhu, Xiaoqun Zhang

Publication date 19 August 2025

Published in CSIAM Transactions on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/CSIAM-AM.2020-0042

zbMATH Keywords

accelerationcomposite optimizationimage restorationinertial iterationprediction-correctionprimal dual fixed point method

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
• A primal-dual fixed point algorithm for multi-block convex minimization
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• An inertial forward-backward algorithm for monotone inclusions
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Approximate iterations in Bregman-function-based proximal algorithms
• Comparison of two kinds of prediction-correction methods for monotone variational inequalities
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
• Proximity algorithms for image models: denoising
• Signal Recovery by Proximal Forward-Backward Splitting
• Stochastic primal dual fixed point method for composite optimization
• The Split Bregman Method for L1-Regularized Problems
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

Cited in

(1)

• Optimization constraints and practical implementations of a stochastic primal-dual fixed-point algorithm for blind image deconvolution

This page was built for publication: Two modified schemes for the primal dual fixed point method

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