carpathian_2023_39_1_315_323We show that the choice of stepsize in Korpelevich’s extragradient algorithm is sharp, while the choice of stepsize in Popov’s extragradient algorithm can be relaxed. We also extend Korpelevich’s extragradient algorithm and Popov’s extragradient algorithm (with larger stepsize) to the infinite-dimensional Hilbert space framework, with weak convergence.
| Author(s) | Xu, Hong-Kun, Wang, Jiaojiao |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2023.01.22 |
Stability of new functional equations and partial multipliers in Banach *-algebras
Characterizations of amenable gyrogroups related to Tarski's Theorem
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
Consequences of the product rule in Stieltjes differentiability
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
A quaternionic product of simple ratios
