Abstract
In this article we present a new and efficient method for solving equilibrium problems on polyhedra. The method is based on an interior-quadratic proximal term which replaces the usual quadratic proximal term. This leads to an interior proximal type algorithm. Each iteration consists in a prediction step followed by a correction step as in the extragradient method. In a first algorithm each of these steps is obtained by solving an unconstrained minimization problem, while in a second algorithm the correction step is replaced by an Armijo-backtracking linesearch followed by an hyperplane projection step. We prove that our algorithms are convergent under mild assumptions: pseudomonotonicity for the two algorithms and a Lipschitz property for the first one. Finally we present some numerical experiments to illustrate the behavior of the proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antipin A.S.: The convergence of proximal methods to fixed points of extremal mappings and estimates of their rates of convergence. Comput. Maths Math. Phys. 35, 539–551 (1995)
Auslender A., Teboulle M., Ben-Tiba S.: A logarithmic-quadratic proximal method for variational inequalities. Comput. Optim. Appl. 12, 31–40 (1999)
Auslender A., Teboulle M., Ben-Tiba S.: Interior proximal and multiplier methods based on second order homogeous kernels. Math. Oper. Res. 24, 645–668 (1999)
Auslender A., Teboulle M.: Lagrangian duality and related multiplier methods for variational inequality problems. SIAM J. Optim. 10(4), 1097–1115 (2000)
Auslender A., Teboulle M.: Entropic proximal decomposition methods for convex programs and variational inequalities. Math. Program. 91, 33–47 (2001)
Auslender A., Teboulle M.: The log-quadratic proximal methodology in convex optimization algorithms and variational inequalities. In: Daniele, P., Giannessi, F., Maugeri, A. (eds) Equilibrium Problems and Variational Models. Nonconvex Optimization and its Applications, vol. 68, pp. 19–52. Kluwer Academic Publishers, Dordrecht, The Netherlands (2003)
Auslender A., Teboulle M.: Interior gradient and epsilon-subgradient descent methods for constrained convex minimization. Math. Oper. Res. 29, 1–26 (2004)
Auslender A., Teboulle M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104, 39–68 (2005)
Auslender A., Teboulle M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697–725 (2006)
Bnouhachem A.: An LQP method for pseudomonotone variational inequalities. J. Global Optim. 36, 351–363 (2006)
Bnouhachem A.: A new inexactness criterion for approximate logarithmic-quadratic proximal methods. Numer. Math. J. Chinese Univ. (English Ser.) 15(1), 74–81 (2006)
Blum E., Oettli W.: From optimization and variational inequalities to equilibrium problems. The Math. Student 63, 123–145 (1994)
Burachik R.S., Svaiter B.F.: A relative error tolerance for a family of generalized proximal point methods. Math. Oper. Res. 26(4), 816–831 (2001)
Cohen G.: Auxiliary problem principle extended to variational inequalities. J. Optim. Theory Appl. 59, 325–333 (1988)
Facchinei F., Pang J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer-Verlag, New-York (2003)
Flåm S.D., Antipin A.S.: Equilibrium programming using proximal-like algorithms. Math. Program. 78, 29–41 (1997)
Konnov I.: Combined relaxation methods for finding equilibrium points and solving related problems. Russ. Math. 37, 44–51 (1993)
Konnov, I.: Combined Relaxation Methods for Variational Inequalities. Springer (2001)
Konnov I.: Combined relaxation method for monotone equilibrium problems. J. Optim. Theory Appl. 111, 327–340 (2001)
Korpelevich G.M.: Extragradient method for finding saddle points and other problems. Matecon 12, 747–756 (1976)
Lemaréchal C., Strodiot J.J., Bihain A.: On a Bundle Method for Nonsmooth Optimization. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds) Nonlinear Programming, vol. 4, pp. 245–282. Academic Press, New York (1981)
Mastroeni G.: On Auxiliary Principle for Equilibrium Problems. In: Daniele, P., Giannessi, F., Maugeri, A. (eds) Equilibrium Problems and Variational Models, vol. 68, Nonconvex Optimization and its Applications., pp. 289–298. Kluwer Academic Publishers, Dordrecht, The Netherlands (2003)
Muu, L.D., Nguyen, V.H., Quy, N.V.: On Nash-Cournot oligopolistic market equilibrium models with concave cost functions. J. Global Optim. doi:10.1007/s10898-007-9243-0
Nguyen T.T.V., Nguyen V.H., Strodiot J.J.: A bundle interior proximal method for solving convex minimization problems. J. Convex Anal. 12, 95–111 (2005)
Nguyen, T.T.V., Strodiot, J.J., Nguyen, V.H.: A bundle method for solving equilibrium problems. Math. Program. doi:10.1007/s10107-007-0112-x
Noor M.A., Bnouhachem A.: Modified proximal-point method for nonlinear complementarity problems. J. Comput. Appl. Math. 197, 395–405 (2006)
Rockafellar R.T.: Convex Analysis. Princeton, New Jersey (1970)
Solodov M., Svaiter B.: Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88, 371–389 (2000)
Tran, D.Q., Muu, L.D., Nguyen, V.H.: Extragradient algorithms extended to equilibrium problems. Optimization doi:10.1080/02331930601122876
Xu Y., He B., Yuan X.: A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems. J. Math. Anal. Appl. 322, 276–287 (2006)
Yuan X.:: The prediction-correction approach to nonlinear complementarity problems. Eur. J. Oper. Res. 176, 1357–1370 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Van Nguyen, T.T., Strodiot, JJ. & Nguyen, V.H. The interior proximal extragradient method for solving equilibrium problems. J Glob Optim 44, 175–192 (2009). https://doi.org/10.1007/s10898-008-9311-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-008-9311-0