Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games
From MaRDI portal
Publication:3083340
DOI10.1137/100786733zbMath1209.91017arXiv1007.4458MaRDI QIDQ3083340
Boris S. Mordukhovich, Vera Roshchina, Javier F. Peña
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
Nash equilibria; variational analysis; metric regularity; smoothing algorithm; matrix games; Lipschitzian stability
90C30: Nonlinear programming
91A05: 2-person games
49M37: Numerical methods based on nonlinear programming
Related Items
First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games, Generalized Newton's method based on graphical derivatives, METRIC REGULARITY—A SURVEY PART II. APPLICATIONS