Primal-dual methods for solving infinite-dimensional games

DOI10.1007/s10957-015-0771-3zbMath1327.90108OpenAlexW771900808MaRDI QIDQ493268

Pavel Dvurechensky, Vladimir Spokoiny, Yu. E. Nesterov

Publication date: 3 September 2015

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

Full work available at URL: https://doi.org/10.1007/s10957-015-0771-3

zbMATH Keywords

differential gamesconvex optimizationsaddle-point problemsprimal-dual optimization methods

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Differential games and control (49N70) Differential games (aspects of game theory) (91A23)

Related Items

Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators, Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle, Accelerated variance-reduced methods for saddle-point problems

Cites Work

• Unnamed Item
• Primal-dual subgradient methods for convex problems
• On general minimax theorems
• Dual extrapolation and its applications to solving variational inequalities and related problems
• Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization