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.90186OpenAlexW2589182068MaRDI 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 inequalitiesconvex programmingconvergence ratesaddle point problemimage restorationvariational modelsprimal-dual hybrid gradient method
Convex programming (90C25) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
On the linear convergence of the general first order primal-dual algorithm ⋮ A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective ⋮ A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ 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 ⋮ An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function ⋮ A double extrapolation primal-dual algorithm for saddle point problems ⋮ Primal-dual hybrid gradient method for distributionally robust optimization 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 ⋮ Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems ⋮ A modified primal-dual method with applications to some sparse recovery problems ⋮ On the nonexpansive operators based on arbitrary metric: a degenerate analysis ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ On convergence of the Arrow-Hurwicz method for saddle point problems ⋮ A primal-dual flow for affine constrained convex optimization
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
This page was built for publication: An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
