An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
From MaRDI portal
Publication:1702597
DOI10.1007/s10851-017-0709-5zbMath1387.90186MaRDI QIDQ1702597
Feng Ma, Xiao-Ming Yuan, Bing-sheng He
Publication date: 28 February 2018
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-017-0709-5
variational inequalities; convex programming; convergence rate; saddle point problem; image restoration; variational models; primal-dual hybrid gradient method
90C25: Convex programming
68U10: Computing methodologies for image processing
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
Related Items
A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems, Approximate first-order primal-dual algorithms for saddle point problems, A primal-dual flow for affine constrained convex optimization, Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis, A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings, A two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation *, The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis, Primal-dual hybrid gradient method for distributionally robust optimization problems, Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems, On the nonexpansive operators based on arbitrary metric: a degenerate analysis, On convergence of the Arrow-Hurwicz method for saddle point problems, On the linear convergence of the general first order primal-dual algorithm, A double extrapolation primal-dual algorithm for saddle point problems, A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems, A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization, A modified primal-dual method with applications to some sparse recovery problems, On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective, A generalized forward-backward splitting operator: degenerate analysis and applications, An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A unified primal-dual algorithm framework based on Bregman iteration
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Modified Lagrangians in convex programming and their generalizations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
