Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems
From MaRDI portal
Publication:6133907
DOI10.1007/S11075-023-01509-WzbMATH Open1523.65051MaRDI QIDQ6133907FDOQ6133907
Fan Jiang, Deren Han, Xing-Ju Cai
Publication date: 21 August 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Recommendations
- Approximate first-order primal-dual algorithms for saddle point problems
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Approximate ADMM algorithms derived from Lagrangian splitting
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
saddle point problemlinear convergence rateinexact criteriaasymmetric forward-backward-adjoint splitting
Numerical mathematical programming methods (65K05) Convex programming (90C25) Minimax problems in mathematical programming (90C47)
This page was built for publication: Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133907)
