First-order algorithm with ${\mathcal{O}({\rm ln}(1{/}\epsilon))}$ convergence for ${\epsilon}$ -equilibrium in two-person zero-sum games
Authors:
- 27 November 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 133 (1-2) , 279-298
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Smoothing Techniques for Computing Nash Equilibria of Sequential GamesMathematics of Operations Research, 2010
- Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix GamesSIAM Journal on Optimization, 2010
- Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programmingMathematical Programming, 2009
- Excessive Gap Technique in Nonsmooth Convex MinimizationSIAM Journal on Optimization, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Potential Function Methods for Approximately Solving Linear Programming Problems2002
- Fundamentals of Convex Analysis2001
- The complexity of two-person zero-sum games in extensive formGames and Economic Behavior, 1992
- On convergence rates of subgradient optimization methodsMathematical Programming, 1977
- Linear Programming and Extensions1963