General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis

DOI10.1142/S0217595921500445OpenAlexW3198950287MaRDI QIDQ5057652

Zhongming Wu, Min Li

Publication date: 19 December 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921500445

zbMATH Keywords

convex programmingconvergence ratesplitting methodssaddle-point problemsprimal-dual hybrid gradient methodinexactness criterion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings ⋮ Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems

This page was built for publication: General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis