Interior proximal methods for equilibrium programming: part I

References

• Bauschke , HH and Borwein , JM . 1997 . Legendre functions and the method of random Bregman projections . J. Convex Anal. , 4 : 27 – 67 .
   Google Scholar
• Bigi , G , Castellani , M and Pappalardo , M . 2009 . A new solution method for equilibrium problems . Optim. Methods Softw. , 24 : 895 – 911 .
   Web of Science ®Google Scholar
• Blum , E and Oettli , W . 1994 . From optimization and variational inequalities to equilibrium problems . Math. Stud. , 63 : 123 – 145 .
   Google Scholar
• Burachik , RS and Iusem , AN . 1998 . A generalized proximal point algorithm for the variational inequality problem in Hilbert space . SIAM J. Optim. , 8 : 197 – 216 .
   Web of Science ®Google Scholar
• Cavazutti , E , Pappalardo , M and Passacantando , M . 2002 . Nash equilibria, variational inequalities and dynamical systems . J. Optim. Theory Appl. , 114 : 491 – 506 .
   Web of Science ®Google Scholar
• Censor , Y , Iusem , AN and Zenios , SA . 1998 . An interior point method with Bregman functions for the variational inequality problem with paramonotone operators . Math. Program. , 81 : 373 – 400 .
   Web of Science ®Google Scholar
• Censor , Y and Zenios , SA . 1992 . Proximal minimization algorithm with D-functions . J. Optim. Theory Appl. , 73 : 451 – 464 .
   Web of Science ®Google Scholar
• Chen , G and Teboulle , M . 1993 . Convergence analysis of a proximal like minimization algorithm using Bregman functions . SIAM J. Optim. , 3 : 538 – 543 .
   Web of Science ®Google Scholar
• Crouzeix , J-P , Marcotte , P and Zhu , D . 2000 . Conditions ensuring the applicability of cutting plane methods for solving variational inequalities . Math. Program. , 88 : 521 – 539 .
   Web of Science ®Google Scholar
• Eckstein , J . 1993 . Nonlinear proximal point algorithms using Bregman functions, with application to convex programming . Math. Oper. Res. , 18 : 202 – 226 .
   Web of Science ®Google Scholar
• Facchinei , F and Kanzow , C . 2007 . Generalized Nash equilibrium problems . 4 OR , 5 : 173 – 210 .
   Web of Science ®Google Scholar
• Facchinei , F and Pang , J-S . 2003 . Finite-Dimensional Variational Inequalities and Complementarity Problems , New York, Berlin, Heidelberg, Hong Kong, London, Milan, Paris, Tokyo : Springer .
   Google Scholar
• Flåm , SD and Antipin , AS . 1997 . Equilibrium programming using proximal-like algorithms . Math. Program. , 77 : 29 – 41 .
   Google Scholar
• Flåm , SD and Ruszczynski , A . 2008 . Finding normalized equilibrium in convex-concave games . Int. Game Theory Rev. , 10 : 37 – 58 .
   Google Scholar
• Hiriart-Urruty , J-B and Lemarechal , C . 1993 . Convex Analysis and Minimization Algorithms , Berlin : Springer Verlag .
   Google Scholar
• Iusem , AN . 2011 . On the maximal monotonicity of diagonal subdifferential operators . J. Convex Anal. , 18 : 489 – 503 .
   Web of Science ®Google Scholar
• Iusem , AN , Kassay , G and Sosa , W . 2009 . On certain conditions for the existence of solutions of equilibrium problems . Math. Program. B , 116 : 259 – 273 .
   Web of Science ®Google Scholar
• Iusem , AN and Nasri , M . 2007 . Inexact proximal point methods for equilibrium problems in Banach spaces . Numer. Funct. Anal. Optim. , 28 : 1279 – 1308 .
   Web of Science ®Google Scholar
• Iusem , AN and Sosa , W . 2010 . On the proximal point method for equilibrium problems in Hilbert spaces . Optimization , 59 : 1259 – 1274 .
   Web of Science ®Google Scholar
• Kaplan , A and Tichatschke , R . 2010 . Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets . Discus. Math.: Differ. Inclusions, Control Optim. , 30 : 51 – 59 .
   Google Scholar
• Langenberg , N . Interior proximal methods for equilibrium programming: Part II, Optimization , (to appear). doi: 10.1080/02331934.2011.627334
   Google Scholar
• Langenberg , N . 2010 . Pseudomonotone operators and the Bregman proximal point algorithm . J. Global Optim. , 47 : 537 – 555 .
   Web of Science ®Google Scholar
• Langenberg , N . 2011 . Convergence analysis of an extended Auxiliary Problem Principle with various stopping criteria . Optim. Methods Softw. , 26 : 127 – 154 .
   Web of Science ®Google Scholar
• Langenberg , N . 2011 . On the cutting plane property and the Bregman Proximal Point Algorithm . J. Convex Anal. , 18 : 601 – 619 .
   Web of Science ®Google Scholar
• von Heusinger , A and Kanzow , C . 2009 . Optimization reformulations of the generalized nash equilibrium problem using Nikaido–Isoda type functions . Comput. Optim. Appl. , 43 : 353 – 377 .
   Web of Science ®Google Scholar