Abstract
We present a bundle method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. First, we consider a general algorithm that we prove to be convergent. Then we explain how to make this algorithm implementable. The strategy is to approximate the nonsmooth convex functions by piecewise linear convex functions in such a way that the subproblems are easy to solve and the convergence is preserved. In particular, we introduce a stopping criterion which is satisfied after finitely many iterations and which gives rise to Δ-stationary points. Finally, we apply our implementable algorithm for solving the particular case of singlevalued and multivalued variational inequalities and we find again the results obtained recently by Salmon et al. [18].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anh P.N. and Muu L.D. (2004). Coupling the banach contraction mapping principle and the proximal point algorithm for solving monotone variational inequalities. Acta Math. Vietnam. 29: 119–133
Aubin J.P. and Ekeland I. (1984). Applied Nonlinear Analysis. Wiley, New York
Blum E. and Oettli W. (1994). From optimization and variational inequalities to equilibrium problems. Math. Stud. 63: 123–145
Cohen G. (1988). Auxiliary problem principle extended to variational inequalities. J. Optim. Theory Appl. 59: 325–333
Correa R. and Lemaréchal C. (1993). Convergence of some algorithms for convex minimization. Math. Program. 62: 261–275
El Farouq N. (2001). Pseudomonotone variational inequalities: convergence of the auxiliary problem method. J. Optim. Theory Appl. 111: 305–326
Gol’shtein E.G. (2002). A method for solving variational inequalities defined by monotone mappings. Comput. Math. Math. Phys. 42(7): 921–930
Hiriart-Urruty J.B. and Lemaréchal C. (1993). Convex Analysis and Minimization Algorithms. Springer, Berlin
Iusem A. and Sosa W. (2003). New existence results for equilibrium problem. Nonlinear Anal. Theory Methods Appl. 52: 621–635
Iusem A. and Sosa W. (2003). Iterative algorithms for equilibrium problems. Optimization 52: 301–316
Kiwiel K.C. (1995). Proximal level bundle methods for convex nondifferentiable optimization, saddle point problems and variational inequalities. Math. Program. 69(1): 89–109
Konnov I.V. (2001). Combined Relaxation Methods for Variational Inequalities. Springer, Berlin
Konnov I.V. (1996). The application of a linearization method to solving nonsmooth equilibrium problems. Russ. Math. 40(12): 54–62
Lemaréchal C., Nemirovskii A. and Nesterov Y. (1995). New variants of bundle methods. Math. Program. 69(1): 111–147
Lemaréchal C., Strodiot J.J. and Bihain A. (1981). On a bundle method for nonsmooth optimization. In: Mangasarian, O.L., Meyer, R.R., and Robinson, S.M. (eds) Nonlinear Programming, vol. 4, pp 245–282. Academic, New York
Mastroeni G. (2003). On auxiliary principle for equilibrium problems. In: Daniele, P., Giannessi, F. and Maugeri, A. (eds) Equilibrium Problems and Variational Models, pp 289–298. Kluwer, Dordrecht
Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton
Salmon G., Strodiot J.J. and Nguyen V.H. (2004). A bundle method for solving variational inequalities. SIAM J. Optim. 14(3): 869–893
Zhu D. and Marcotte P. (1996). Co-coercivity and its role in the convergence of iterative schemes for solving variational inequalities. SIAM J. Optim. 6: 714–726
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by a FUNDP Doctoral Institutional Scholarship CA-04-314, CA-05-303 and CA-06-689, and a CIUF-CUD Scholarship CUI-UNV02 and CUI-MT03.
Rights and permissions
About this article
Cite this article
Nguyen, T.T. ., Strodiot, J.J. & Nguyen, V.H. A bundle method for solving equilibrium problems. Math. Program. 116, 529–552 (2009). https://doi.org/10.1007/s10107-007-0112-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-007-0112-x