Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-10T22:32:22.638Z Has data issue: false hasContentIssue false
  • English
  • Français

An analytic center cutting plane algorithm for finding equilibrium points

Published online by Cambridge University Press:  01 July 2006

Fernanda M.P. Raupp  and
Wilfredo Sosa
Fernanda M.P. Raupp
Affiliation:
Laboratório Nacional de Computação Científica – MCT, Av. Getúlio Vargas, 333, Petrópolis, RJ, CEP 25651-075, Brazil; fernanda@lncc.br
Wilfredo Sosa
Affiliation:
Instituto de Matemática e Ciencias Afines – Universidad Nacional de Ingeniería, Jirón Ancash 536, Lima 1, Lima, Peru; sosa@uni.edu.pe
Get access

Abstract

We present a variant of the analytic center cutting plane algorithm proposedby Goffin et al. (1996) to approximately solve equilibrium problemsas proposed by Blum and Oettli (1994), which include as particular problemsthe variational inequalities problem, the Nash equilibria problem innon-cooperative games, the convex minimization problem, and the fixed pointproblem. Furthermore, we analyze the convergence and complexity of the modifiedalgorithm.

Keywords

Equilibrium problemsconvex feasibility problemanalytic center cutting plane algorithm.
Type
Research Article
Information
RAIRO - Operations Research , Volume 40 , Issue 1 , January 2006 , pp. 37 - 52
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Antipin, A.S. and Vasil'ev, F.P., A stabilization method for equilibrium programming problems with an inexactly specified set. Comp. Math. Math. Phys. 39 (1999) 1707–1714.
A.S. Antipin, From Optima to Equilibria, in Proceedings of ISA RAS, Dynamics of Non-Homogeneous Systems. Editorial URSS-Moscow 3 (2000) 35–64.
Bianchi-Pini, A note on equilibrium problems with properly quasimonotone bifunctions. J. Global Optim. 20 (2001) 67–76. CrossRef
Blum, E. and Oettli, W., From optimization and variational inequalities to equilibrium problems. The Mathematics Student 63 (1994) 123–145.
L.M. Bregman, The relaxation method for finding a common point of convex sets and its applications to solution of problems in convex programming. USSR Comp. Math. Math. Phys. 7 (1967) 200–217.
Brezis, H., Niremberg, L. and Stampachia, G., A remark on Ky Fan's minimax principle. Boll. Un. Mat. Ital. 6 (1972) 293–300.
K. Fan, A minimax inequality and applications, in Inequality III, edited by O. Shisha. Academic Press, NY (1972) 103–113.
Goffin, J.-L., Luo, Z.-Q. and Complexity, Y. Ye analysis of an interior cutting plane method for convex feasibility pProblems. SIAM J. Optim. 6 (1996) 638–652. CrossRef
Goffin, J.-L., Gonzio, J., Sarkissian, R. and Vial, J.-P., Solving nonlinear multicommodity flow problems by analytic center cutting plane method. Interior point methods in theory and practice. Math. Program. Ser. B 76 (1997) 131–154.
Gonzaga, C.C., Path following methods for linear programming. SIAM Rev. 34 (1992) 167–224. CrossRef
Korpelevich, G.M., Extragradient method for finding saddle points and other problems. Matecon 12 (1976) 747–756.
Iusem, A.N. and Sosa, W., New existence results for equilibrium problems. Nonlinear Anal.-Theor. 52 (2003) 621–635. CrossRef
Iusem, A.N. and Sosa, W., Iterative algorithms for equilibrium problems. Optimization 52 (2003) 301–316. CrossRef
Nesterov, Y., Complexity estimates of some cutting plane methods based on the analytic barrier. Nondifferentiable and large-scale optimization. Math. Program. Ser. B 69 (1995) 149–176.
Nikaido, H. and Isoda, K., Note on noncooperative convex games. Pacific J. Math. 5 (1955) 807–815. CrossRef
Raupp, F.M.P. and Gonzaga, C.C., A center cutting plane algorithm for a likelihood estimate problem. Comput. Optim. Appl. 21 (2001) 277–300. CrossRef
G. Sonnevend, New algorithms in convex programming based on a notation of center and on rational extrapolations. International Series of Numerical Mathematics, Birkhauser Verlag, Basel, Switzerland 84 (1988) 311–327.
P.M. Vaidya, A Locally Well-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope. Progress in Mathematical Programming: Interior Point and Related Methods, edited by N. Megiddo. Springer, New York (1989) 79–90.
Ye, Y., A potential reduction algorithm allowing column generation. SIAM J. Optim. 2 (1992) 7–20. CrossRef
Complexity, Y. Ye analysis of the analytic center cutting plane method that uses multiple cuts. Math. Program. 78 (1997) 85–104.
Y. Ye, Interior Point Algorithms: Theory and Analysis. Wiley–Interscience Series in Discrete Mathematics and Optimization, John Wiley and Sons, New York (1997).