A bundle method for solving equilibrium problems

Mathematical Programming

Volumn 116, Issue 1-2, 2009, Pages 529-552

  Nguyen, T T V ^a,b   Strodiot, J J ^a   Nguyen, V H ^a  

^a UNIVERSITY OF NAMUR   (Belgium)

^b UNIVERSITY OF NATURAL SCIENCES   (Viet Nam)

Author keywords

Bundle methods; Equilibrium problems; Variational inequalities

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; ALUMINUM; BOOLEAN FUNCTIONS; EVOLUTIONARY ALGORITHMS; INTEGER PROGRAMMING; PIECEWISE LINEAR TECHNIQUES; SCHEDULING ALGORITHMS; VARIATIONAL TECHNIQUES;

AUXILIARY PROBLEM PRINCIPLE (APP); BUNDLE METHODS; CONVERGENCE (MATHEMATICS); CONVEX (CONJUGATE , RECESSION , AFFINE , POLYHEDRAL , SUPPORT) FUNCTION; CONVEX OPTIMIZATION; EQUILIBRIUM PROBLEMS; GENERAL (CO); NONSMOOTH; PIECE-WISE LINEAR (PWL); SPRINGER (CO); STATIONARY POINTS; STOPPING CRITERION; SUB-PROBLEMS; VARIATIONAL INEQUALITIES;

FUNCTION EVALUATION;

EID: 45749123474     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0112-x     Document Type: Article

References (19)

1. 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
2. Aubin J.P. and Ekeland I. (1984). Applied Nonlinear Analysis. Wiley, New York
3. Blum E. and Oettli W. (1994). From optimization and variational inequalities to equilibrium problems. Math. Stud. 63: 123-145
4. Cohen G. (1988). Auxiliary problem principle extended to variational inequalities. J. Optim. Theory Appl. 59: 325-333
5. Correa R. and Lemaréchal C. (1993). Convergence of some algorithms for convex minimization. Math. Program. 62: 261-275
6. El Farouq N. (2001). Pseudomonotone variational inequalities: convergence of the auxiliary problem method. J. Optim. Theory Appl. 111: 305-326
7. Gol'shtein E.G. (2002). A method for solving variational inequalities defined by monotone mappings. Comput. Math. Math. Phys. 42(7): 921-930
8. Hiriart-Urruty J.B. and Lemaréchal C. (1993). Convex Analysis and Minimization Algorithms. Springer, Berlin
9. Iusem A. and Sosa W. (2003). New existence results for equilibrium problem. Nonlinear Anal. Theory Methods Appl. 52: 621-635
10. Iusem A. and Sosa W. (2003). Iterative algorithms for equilibrium problems. Optimization 52: 301-316
11. Kiwiel K.C. (1995). Proximal level bundle methods for convex nondifferentiable optimization, saddle point problems and variational inequalities. Math. Program. 69(1): 89-109
12. Konnov I.V. (2001). Combined Relaxation Methods for Variational Inequalities. Springer, Berlin
13. Konnov I.V. (1996). The application of a linearization method to solving nonsmooth equilibrium problems. Russ. Math. 40(12): 54-62
14. Lemaréchal C., Nemirovskii A. and Nesterov Y. (1995). New variants of bundle methods. Math. Program. 69(1): 111-147
15. 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
16. 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
17. Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton
18. Salmon G., Strodiot J.J. and Nguyen V.H. (2004). A bundle method for solving variational inequalities. SIAM J. Optim. 14(3): 869-893
19. 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