РЕГУЛЯРИЗОВАНИЙ АДАПТИВНИЙ ЕКСТРАПРОКСИМАЛЬНИЙ АЛГОРИТМ ДЛЯ ЗАДАЧІ ПРО РІВНОВАГУ В ПРОСТОРАХ АДАМАРА

One of the intensively developing areas of modern applied nonlinear analysis is the study of equilibrium problems, also known as Ky Fan inequalities, equilibrium programming problems. In the form of an equilibrium problem, one can formulate variational inequalities, mathematical programming problems...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2020
Hauptverfasser: Vedel, Ya.I., Denisov, S.V., Semenov, V.V.
Format: Artikel
Sprache:English
Veröffentlicht: V.M. Glushkov Institute of Cybernetics of NAS of Ukraine 2020
Schlagworte:
Online Zugang:https://jais.net.ua/index.php/files/article/view/487
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Problems of Control and Informatics

Institution

Problems of Control and Informatics
Beschreibung
Zusammenfassung:One of the intensively developing areas of modern applied nonlinear analysis is the study of equilibrium problems, also known as Ky Fan inequalities, equilibrium programming problems. In the form of an equilibrium problem, one can formulate variational inequalities, mathematical programming problems, and many game theory problems (search of Nash equilibrium). Recently, interest has arisen due to the problems of mathematical biology and machine learning to construct the theory and algorithms for solving mathematical programming problems in Hadamard metric spaces. In this paper, we consider equilibrium problems in Hadamard metric spaces. For an approximate solution of problems, a new iterative regularized adaptive extra-proximal algorithm is proposed and studied. In contrast to the previously used rules for choosing the step size, the proposed algorithm does not calculate bifunction values ​​at additional points and does not require knowledge of information on of bifunction’s Lipschitz constants. For regularization of basic extra-proximal scheme, the classic Halpern scheme is used. For pseudo-monotone bifunctions of Lipschitz type, the theorem on convergence of sequences generated by the algorithm is proved. The proof is based on the use of the Fejer property of the extra-proximal algorithm with respect to the set of solutions of problem and known results on the convergence of the Halpern scheme. It is shown that the proposed algorithm is applicable to pseudo-monotone variational inequalities in Hilbert spaces.