First-order algorithms for min-max problems with non-linear coupled constraints

DOI10.1007/S10957-026-03098-9MaRDI QIDQ7402289zbMATH OpenFDO

Authors Ioannis Tsaknakis, Prashant Khanduri, Mingyi Hong, Shuzhong Zhang

Publication date 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-026-03098-9

zbMATH Keywords

coupled constraintsmin-max

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Mathematical programming (90Cxx)

Cites work

• Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
• Handbook of combinatorial optimization. In 5 volumes
• Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
• Lectures on convex optimization
• Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
• On a theorem of Danskin with an application to a theorem of Von Neumann-Sion
• Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
• Optimization for data analysis
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints

This page was built for publication: First-order algorithms for min-max problems with non-linear coupled constraints

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