Applying metric regularity to compute a condition measure of a smoothing algorithm for matrix games
DOI10.1137/100786733zbMATH Open1209.91017arXiv1007.4458OpenAlexW2068712022MaRDI QIDQ3083340FDOQ3083340
Javier Peña, Boris S. Mordukhovich, Vera Roshchina
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4458
Recommendations
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- On the metric approach in the theory of matrix games
- scientific article; zbMATH DE number 772312
- Conditioning and regularization of nonsymmetric operators
- Regularity and conditioning of solution mappings in variational analysis
smoothing algorithmmetric regularityNash equilibriavariational analysismatrix gamesLipschitzian stability
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) 2-person games (91A05)
Cited In (3)
This page was built for publication: Applying metric regularity to compute a condition measure of a smoothing algorithm for matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083340)