ABOUT THE TWO-STAGE PROXIMAL METHOD FOR SOLVING OF EQUILIBRIUM PROBLEMS
Abstract
In this paper, the weak convergence of an iterative twostage proximal method for the approximate solution of the equilibrium problem in a Hilbert space is investigated. This method was recently been developed by Vedel and Semenov and can be used to solve mathematical programming problems, variational inequalities and game theory problems. The analysis of the convergence of the method was carried out under the assumption of the existence of a solution of the equilibrium problem and under conditions weaker than the previously considered ones.
References
Antipin A. S. Equilibrium programming: Proximal methods. Comput. Math. Math. Phys. 1997. Vol. 37. P. 1285-1296.
Mastroeni G. On auxiliary principle for equilibrium problems. In: Daniele, P. et al. (eds.) Equilibrium Problems and Variational Models. Kluwer Academic Publishers, Dordrecht, 2003. P. 289-298.
Combettes P. L., Hirstoaga S. A. Equilibrium Programming in Hilbert Spaces. J. Nonlinear Convex Anal. 2005. Vol. 6. P. 117-136.
Konnov I. V. Application of the proximal point method to nonmonotone equilibrium problems. J. Optim. Theory Appl. 2003. Vol. 119. P. 317-333.
Quoc T. D., Muu L. D., Hien N. V. Extragradient algorithms extended to equilibrium problems. Optimization. 2008. Vol. 57. P. 749-776.
Korpelevich G. M. The extragradient method for finding saddle points and other problems. Ekonomika i Matematicheskie Metody. 1976. Vol. 12. P. 747-756.
Lyashko S. I., Semenov V. V., Voitova T. A. Low-cost modification of Korpelevich’s methods for monotone equilibrium problems. Cybernetics and Systems Analysis. 2011. Vol. 47. P. 631-639.
Popov L. D. A modification of the Arrow-Hurwicz method for search of saddle points. Mathematical notes of the Academy of Sciences of the USSR. 1980. Vol. 28. Issue 5. P. 845-848.
Vedel Y. I., Semenov V. V. A new two-phase proximal method of solving the problem of equilibrium programming. Journal of Computational and Applied Mathematics. 2015. No. 1 (118). P. 15-23.
Lyashko S. I., Semenov V. V. A New Two-Step Proximal Algorithm of Solving the Problem of Equilibrium Programming. In: B. Goldengorin (ed.) Optimization and Its Applications in Control and Data Sciences. Springer Optimization and Its Applications, vol. 115. Springer, Cham, 2016. P. 315-325.
Chabak L., Semenov V., Vedel Y. A New Non-Euclidean Proximal Method for Equilibrium Problems. In: Chertov O., Mylovanov T., Kondratenko Y., Kacprzyk J., Kreinovich V., Stefanuk V. (eds.) Recent Developments in Data Science and Intelligent Analysis of Information. ICDSIAI 2018. Advances in Intelligent Systems and Computing, vol. 836. Springer, Cham, 2019. P. 50-58.
Bauschke H. H., Combettes P. L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Berlin, Heidelberg, New York: Springer, 2011. 408 p.
Malitsky Yu. V., Semenov V. V. An extragradient algorithm for monotone variational inequalities. Cybernetics and Systems Analysis. 2014. Vol. 50. P. 271-277.
Semenov V. V. A Version of the Mirror descent Method to Solve Variational Inequalities. Cybernetics and Systems Analysis. 2017. Vol. 53. P. 234-243.
Semenov V. V. A variant of mirror descent method for solving variational inequalities. In: Polyakova, L. N. (ed.) Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V. F. Demyanov). IEEE, 2017. P. 281-284. doi: https://doi.org/10.1109/CNSA.2017.7974011
Nomirovskii D. A., Rublyov V. V., Semenov V. V. Convergence of Two-Stage Method with Bregman Divergence for Solving Variational Inequalities. Cybernetics and Systems Analysis. 2019. Vol. 55. P. 359-368.
Gidel G., Berard H., Vincent P., Lacoste-Julien S. A Variational Inequality Perspective on Generative Adversarial Networks. arXiv:1802.10551. 2018.
Opial Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. 1967. Vol. 73. P. 591-597.
