Abstract
In this paper, we propose a Bregman regularized proximal point method for solving monotone equilibrium problems. Existence and uniqueness results as well as convergence of the sequence to a solution of an equilibrium problem is analyzed. We assume a coercivity condition on the Bregman function weaker than the one considered in the literature on equilibrium problems with Bregman regularization. Numerical experiments illustrate the efficiency of the method.
Similar content being viewed by others
References
Auslender, A., Teboulle, M., Ben-Tiba, S.: A logarithmic-quadratic proximal method for variational inequalities. In: Pang, J.S. (ed.) Computational Optimization. Springer, Boston, MA, pp. 31–40 (1999)
Blum, E., Oettli, W.: From optimization and variational inequalities to equilibrium problems. Math. Stud. 63, 123–145 (1994)
Fan, K.: A minimax inequality and applications. In: Shisha, O. (ed.) Inequality III, pp. 103–113. Academic Press, New York (1972)
Nikaidô, H., Isoda, K.: Note on noncooperative convex games. Pac. J. Math. 5, 807–815 (1955)
Muu, L.D., Oettli, W.: Convergence of an adaptive penalty scheme for finding constrained equilibria. Nonlinear Anal. 18, 1159–1166 (1992)
Iusem, A.N., Kassay, G., Sosa, W.: On certain conditions for the existence of solutions of equilibrium problems. Math. Program. 116, 259–273 (2009)
Iusem, A.N., Sosa, W.: New existence results for equilibrium problems. Nonlinear Anal. 52, 621–635 (2003)
Konnov, I.V.: Application of the proximal method to nonmonotone equilibrium problems. J. Optim. Theory Appl. 119, 317–333 (2003)
Anh, P.N., Le Thi, H.A.: An Armijo-type method for pseudomonotone equilibrium problems and its applications. J. Glob. Optim. 57, 803–820 (2013)
Flam, S.D., Antipin, A.S.: Equilibrium programming using proximal-like algorithms. Math. Program. 78, 29–41 (1997)
Moudafi, A.: Proximal point algorithm extended for equilibrium problems. J. Nat. Geom. 15, 91–100 (1999)
Moudafi, A.: On finite and strong convergence of a proximal method for equilibrium problems. Numer. Func. Anal. Optim. 28(11–12), 1347–1354 (2007)
Mordukhovich, B.S., Panicucci, B., Pappalardo, M., Passacantando, M.: Hybrid proximal methods for equilibrium problems. Optim. Lett. 6, 1535–1550 (2012)
Panicucci, B., Pappalardo, M., Passacantando, M.: On solving generalized Nash equilibrium problems via optimization. Optim. Lett. 3, 419–435 (2010)
Bigi, G., Passacantando, M.: Descent and penalization techniques for equilibrium problems with non-linear constraints. J. Optim. Theory Appl. 164(3), 804–818 (2015)
Santos, P.J.S., Santos, P.S.M., Scheimberg, S.: A proximal Newton-type method for equilibrium problems. Optim. Lett. 12, 997–1009 (2018)
Bigi, G., Castellani, M., Pappalardo, M., Passacantando, M.: Existence and solution methods for equilibria. Eur. J. Oper. Res. 227, 1–11 (2013)
Iusem, A.N., Sosa, W.: On the proximal point method for equilibrium problems in Hilbert spaces. Optimization 59, 1259–1274 (2010)
Burachik, R.S., Kassay, G.: On a generalized proximal point method for solving equilibrium problems in Banach spaces. Nonlinear Anal. 75, 6456–6464 (2012)
Bregman, L.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200–217 (1967)
Burachik, R.S., Iusem, A.N.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8, 197–216 (1998)
Censor, Y., Zenios, S.A.: The proximal minimization algorithm with with D-functions. J. Optim. Theory Appl. 73, 451–464 (1992)
Chen, G., Teboulle, M.: Convergence analysis of a proximal-like optimization algorithm using Bregman functions. SIAM J. Optim. 3, 538–543 (1993)
Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18, 202–226 (1993)
Kiwiel, K.C.: Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35, 1142–1168 (1997)
Cruz Neto, J.X., Lopes, J.O., Santos, P.S.M., Souza, J.C.O.: An interior proximal linearized method for DC programming based on Bregman distance or second order homogeneous kernels. Optimization, 1–17 (2018). https://doi.org/10.1080/02331934.2018.1476859
Iusem, A.N., Nasri, M.: Inexact proximal point methods for equilibrium problems in Banach spaces. Numer. Funct. Anal. Optim. 28, 1279–1308 (2007)
Reich, S., Sabach, S.: Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces. Nonlinear Anal. 73, 122–135 (2010)
Burachik, R.S., Scheimberg, S.: A proximal point method for the variational inequality problem in Banach spaces. SIAM J. Control Optim. 39(5), 1633–1649 (2000)
Santos, P.S.M., Scheimberg, S.: An inexact subgradient algorithm for equilibrium problems. Comput. Appl. Math. 30(1), 91–107 (2011)
von Heusinger, A., Kanzow, C.: Relaxation methods for generalized Nash equilibrium problems with inexact line search. J. Optim. Theory Appl. 143(1), 159–183 (2009)
Marcotte, P.: Application of Khobotov’s algorithm to variational inequalities and network equilibrium problems. INFORM Inf. Syst. Oper. Res. 29(4), 258–270 (1991)
Acknowledgements
The work of the first author was supported in part by CNPq Grant 305462/2014-8. The work of the second author was supported in part by CNPq Grant 303368/2016-0. The work of the third author was supported in part by CAPES Grant 88881.123555/2016-01 and CAPES/FAPEAM Grant 062.01818/2015.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Neto, J.X.C., Santos, P.S.M., Silva, R.C.M. et al. On a Bregman regularized proximal point method for solving equilibrium problems. Optim Lett 13, 1143–1155 (2019). https://doi.org/10.1007/s11590-019-01411-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-019-01411-2