New subgradient extragradient methods for common solutions to equilibrium problems

In this paper, three parallel hybrid subgradient extragradient algorithms are proposed for finding a common solution of a finite family of equilibrium problems in Hilbert spaces. The proposed algorithms originate from previously known results for variational inequalities and can be considered as mod...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications Jg. 67; H. 3; S. 571 - 594
1. Verfasser: Van Hieu, Dang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.07.2017
Springer Nature B.V
Schlagworte:
Algorithms
Convergence
Convex and Discrete Geometry
Equilibrium
Equilibrium methods
Inequalities
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Optimization
Statistics
Hybrid method
Equilibrium problem
Parallel computation
Extragradient method
47H05
47J25
65J15
65Y05
Subgradient method
91B50
ISSN:0926-6003, 1573-2894
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, three parallel hybrid subgradient extragradient algorithms are proposed for finding a common solution of a finite family of equilibrium problems in Hilbert spaces. The proposed algorithms originate from previously known results for variational inequalities and can be considered as modifications of extragradient methods for equilibrium problems. Theorems of strong convergence are established under the standard assumptions imposed on bifunctions. Some numerical experiments are given to illustrate the convergence of the new algorithms and to compare their behavior with other algorithms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-017-9899-4