Abstract
Algorithms for solving the Ky Fan inequality EP(f, C) are tackled exploiting the tools developed in the previous chapter. Some assumptions on C and f hold throughout all the chapter in order to provide a unified algorithmic framework. Precisely, C is supposed to be convex and closed, f to be continuous and to satisfy f(x, x) = 0 for any \(x\in \mathbb {R}^n\) while f(x, ⋅) to be τ-convex for any \(x\in \mathbb {R}^n\) for some τ ≥ 0 that does not depend upon the considered point x. Notice that this framework guarantees all the assumptions of the existence Theorems 2.3.4 and 2.3.8 except for the boundedness of C or some kind of monotonicity of f. Indeed, all the algorithms require at least one of them, so that the existence of a solution is always guaranteed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
B. Alleche, V.D. Rădulescu, M. Sebaoui, The Tikhonov regularization for equilibrium problems and applications to quasi-hemivariational inequalities. Optim. Lett. 9, 483–503 (2015)
P.N. Anh, An LQ regularization method for pseudomonotone equilibrium problems on polyhedra. Vietnam J. Math. 36, 209–228 (2008)
P.N. Anh, A logarithmic quadratic regularization method for solving pseudomonotone equilibrium problems. Acta Math. Vietnam. 34, 183–200 (2009)
P.N. Anh, H.A. Le Thi, An Armijo-type method for pseudomonotone equilibrium problems and its applications. J. Glob. Optim. 57 803–820 (2013)
P.N. Anh, H.A. Le Thi, The subgradient extragradient method extended to equilibrium problems. Optimization 64, 225–248 (2015)
P.N. Anh, T.N. Hai, P.M. Tuan, On ergodic algorithms for equilibrium problems. J. Glob. Optim. 64, 179–195 (2016)
P.N. Anh, T.T.H. Anh, N.D. Hien, Modified basic projection methods for a class of equilibrium problems. Numer. Algorithms 79, 139–152 (2018)
H.H. Bauschke, J.M. Borwein, On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)
J.Y. Bello Cruz, P.S.M. Santos, S. Scheimberg, A two-phase algorithm for a variational inequality formulation of equilibrium problems. J. Optim. Theory Appl. 159, 562–575 (2013)
G. Bigi, M. Passacantando, Gap functions and penalization for solving equilibrium problems with nonlinear constraints. Comput. Optim. Appl. 53, 323–346 (2012)
G. Bigi, M. Passacantando, D-gap functions and descent techniques for solving equilibrium problems. J. Glob. Optim. 62, 183–203 (2015)
G. Bigi, M. Passacantando, Descent and penalization techniques for equilibrium problems with nonlinear constraints. J. Optim. Theory Appl. 164, 804–818 (2015)
G. Bigi, M. Passacantando, Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities. Decis. Econ. Finance 40, 63–79 (2017)
G. Bigi, M. Castellani, M. Pappalardo, A new solution method for equilibrium problems. Optim. Methods Softw. 24, 895–911 (2009)
R. Burachik, G. Kassay, On a generalized proximal point method for solving equilibrium problems in Banach spaces. Nonlinear Anal. 75, 6456–6464 (2012)
O. Chadli, I.V. Konnov, J.-C. Yao, Descent methods for equilibrium problems in a Banach space. Comput. Math. Appl. 48, 609–616 (2004)
Ch. Charita, A note on D-gap functions for equilibrium problems. Optimization 62, 211–226 (2013)
D. Di Lorenzo, M. Passacantando, M. Sciandrone, A convergent inexact solution method for equilibrium problems. Optim. Methods Softw. 29, 979–991 (2014)
B.V. Dinh, D.S. Kim, Projection algorithms for solving nonmonotone equilibrium problems in Hilbert space. J. Comput. Appl. Math. 302, 106–117 (2016)
B.V. Dinh, L.D. Muu, A projection algorithm for solving pseudomonotone equilibrium problems and its application to a class of bilevel equilibria. Optimization 64, 559–575 (2015)
B.V. Dinh, P.G. Hung, L.D. Muu, Bilevel optimization as a regularization approach to pseudomonotone equilibrium problems. Numer. Funct. Anal. Optim. 35, 539–563 (2014)
S.D. Flåm, A.S. Antipin, Equilibrium programming using proximal-like algorithms. Math. Program. 78, 29–41 (1997)
D.V. Hieu, A new shrinking gradient-like projection method for equilibrium problems. Optimization 66, 2291–2307 (2017)
P.G. Hung, L.D. Muu, The Tikhonov regularization extended to equilibrium problems involving pseudomonotone bifunctions. Nonlinear Anal. 74, 6121–6129 (2011)
A.N. Iusem, W. Sosa, Iterative algorithms for equilibrium problems. Optimization 52, 301–316 (2003)
I.V. Konnov, Combined relaxation method for monotone equilibrium problems. J. Optim. Theory Appl. 111, 327–340 (2001)
I.V. Konnov, Application of the proximal point method to nonmonotone equilibrium problems. J. Optim. Theory Appl. 119, 317–333 (2003)
I.V. Konnov, Regularization method for nonmonotone equilibrium problems. J. Nonlinear Convex Anal. 10, 93–101 (2009)
I.V. Konnov, M.S.S. Ali, Descent methods for monotone equilibrium problems in Banach spaces. J. Comput. Appl. Math. 188, 165–179 (2006)
I.V. Konnov, D.A. Dyabilkin, Nonmonotone equilibrium problems: coercivity conditions and weak regularization. J. Glob. Optim. 49, 575–587 (2011)
I.V. Konnov, O.V. Pinyagina, Descent method with respect to the gap function for nonsmooth equilibrium problems. Russ. Math. 47, 67–73 (2003)
I.V. Konnov, O.V. Pinyagina, D-gap functions for a class of equilibrium problems in Banach spaces. Comput. Methods Appl. Math. 3, 274–286 (2003)
I.V. Konnov, O.V. Pinyagina, D-gap functions and descent methods for a class of monotone equilibrium problems. Lobachevskii J. Math. 13, 57–65 (2003)
I.V. Konnov, S. Schaible, J.C. Yao, Combined relaxation method for mixed equilibrium problems. J. Optim. Theory Appl. 126, 309–322 (2005)
N. Langenberg, Interior proximal methods for equilibrium programming: part I. Optimization 62, 1247–1266 (2013)
N. Langenberg, Interior proximal methods for equilibrium programming: part II. Optimization 62, 1603–1625 (2013)
G. Mastroeni, On auxiliary principle for equilibrium problems, in Equilibrium Problems and Variational Models, ed. by P. Daniele, F. Giannessi, A. Maugeri (Kluwer Academic, Norwell, 2003), pp. 289–298
G. Mastroeni, Gap functions for equilibrium problems. J. Glob. Optim. 27, 411–426 (2003)
A. Moudafi, Proximal point methods extended to equilibrium problems. J. Nat. Geom. 15, 91–100 (1999)
A. Moudafi, M. Théra, Proximal and dynamical approaches to equilibrium problems, in Ill-Posed Variational Problems and Regularization Techniques, ed. by M. Théra, R. Tichatschke (Springer, Berlin, 1999), pp. 187–201
L.D. Muu, T.D. Quoc, Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model. J. Optim. Theory Appl. 142, 185–204 (2009)
T.P.D. Nguyen, J.J. Strodiot, T.T.V. Nguyen, V.H. Nguyen, A family of extragradient methods for solving equilibrium problems. J. Ind. Manag. Optim. 11, 619–630 (2015)
T.T.V. Nguyen, J.J. Strodiot, V.H. Nguyen, A bundle method for solving equilibrium problems. Math. Program. 116, 529–552 (2009)
T.T.V. Nguyen, J.J. Strodiot, V.H. Nguyen, The interior proximal extragradient method for solving equilibrium problems. J. Glob. Optim. 44, 175–192 (2009)
T.D. Quoc, L.D Muu, Iterative methods for solving monotone equilibrium problems via dual gap functions. Comput. Optim. Appl. 51, 709–728 (2012)
T.D. Quoc, M.L. Dung, V.H. Nguyen, Extragradient algorithms extended to equilibrium problems. Optimization 57, 749–776 (2008)
T.D. Quoc, P.N. Anh, L.D. Muu, Dual extragradient algorithms extended to equilibrium problems. J. Glob. Optim. 52, 139–159 (2012)
F.M.P. Raupp, W. Sosa, An analytic center cutting plane algorithm for finding equilibrium points. RAIRO Oper. Res. 40, 37–52 (2006)
P.S.M. Santos, S. Scheimberg, An inexact subgradient algorithm for equilibrium problems. Comput. Appl. Math. 30, 91–107 (2011)
P.S.M. Santos, S. Scheimberg, An outer approximation algorithm for equilibrium problems in Hilbert spaces. Optim. Methods Softw. 30, 379–390 (2015)
S. Scheimberg, P.S.M. Santos, A relaxed projection method for finite-dimensional equilibrium problems. Optimization 60, 1193–1208 (2011)
J.J. Strodiot, P.T. Vuong, T.T.V. Nguyen, A class of shrinking projection extragradient methods for solving non-monotone equilibrium problems in Hilbert spaces. J. Glob. Optim. 64, 159–178 (2016)
L.C. Zeng, J.C. Yao, Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces. J. Optim. Theory Appl. 131, 469–483 (2006)
L. Zhang, J.Y. Han, Unconstrained optimization reformulations of equilibrium problems. Acta Math. Sin. 25, 343–354 (2009)
L. Zhang, S.-Y. Wu, An algorithm based on the generalized D-gap function for equilibrium problems. J. Comput. Appl. Math. 231, 403–411 (2009)
L. Zhang, S.-Y. Wu, S.-C. Fang, Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium problems. J. Ind. Manag. Optim. 6, 333–346 (2010)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bigi, G., Castellani, M., Pappalardo, M., Passacantando, M. (2019). Algorithms for Equilibria. In: Nonlinear Programming Techniques for Equilibria. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-00205-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-00205-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00204-6
Online ISBN: 978-3-030-00205-3
eBook Packages: Business and ManagementBusiness and Management (R0)