Generalized optimistic methods for convex-concave saddle point problems

DOI10.1137/24M1630475MaRDI QIDQ6918404zbMATH OpenFDO

Authors Ruichen Jiang, Aryan Mokhtari

Publication date 10 October 2025

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1630475

zbMATH Keywords

convex-concave saddle point problemsoptimistic methodssecond-order methods

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Minimax problems in mathematical programming (90C47)

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A forward-backward splitting method for monotone inclusions without cocoercivity
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• A modification of the Arrow-Hurwicz method for search of saddle points
• A primal-dual algorithm with line search for general convex-concave saddle point problems
• Accelerating the cubic regularization of Newton's method on convex problems
• Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
• Cubic regularization of Newton method and its global performance
• Cubic regularized Newton method for the saddle point models: a global and local convergence analysis
• Dual extrapolation and its applications to solving variational inequalities and related problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Methods of conjugate gradients for solving linear systems
• Monotone Operators and the Proximal Point Algorithm
• On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
• Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
• Perseus: a simple and optimal high-order method for variational inequalities
• Projected reflected gradient methods for monotone variational inequalities
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Proximal extrapolated gradient methods for variational inequalities
• Simple and optimal methods for stochastic variational inequalities. I: Operator extrapolation

Cited in

(2)

• An accelerated primal dual algorithm with backtracking for decentralized constrained optimization
• An adaptive interior-point method with backtracking line search for convex constrained optimization

This page was built for publication: Generalized optimistic methods for convex-concave saddle point problems

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