Сходимость двухэтапного проксимального алгоритма для задачи о равновесии в пространствах Адамара / Ведель Я. И., Сандраков Г. В., Семенов В. В., Чабак Л. М. (2020)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2020, 56 (5))

Vedel Y.I., Sandrakov G.V., Semenov V.V., Chabak L.M.
Convergence of a two-stage proximal algorithm for equilibrium problems in Hadamard spaces

An iterative two-stage proximal algorithm for approximate solution of equilibrium problems in Hadamard spaces is considered. This algorithm is an analog of the already studied two-stage algorithm for equilibrium problems in a Hilbert space. For Lipschitz-type pseudo-monotone bifunctions, a theorem on the weak convergence of sequences generated by the algorithm is proved. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: convergence, equilibrium problem, Hadamard space, pseudo-monotonicity, two-stage algorithm, Computer science, Cybernetics, Approximate solution, Bifunctions, Equilibrium problem, Hadamard, Lipschitz, Proximal algorithm, Two-stage algorithm, Weak convergence, Iterative methods


Cite:
Vedel Y.I., Sandrakov G.V., Semenov V.V., Chabak L.M. (2020). Convergence of a two-stage proximal algorithm for equilibrium problems in Hadamard spaces. Cybernetics and Systems Analysis, 56 (5), 115–125. doi: https://doi.org/10.1007/s10559-020-00299-6 http://jnas.nbuv.gov.ua/article/UJRN-0001152227 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна