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 |
An inertial method for solving the split equality fixed point problem with multiple output sets
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
Properties of isocompact spaces in topological groups
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
Global-fixed-point property of gyrogroup actions
On simple normal structure and best proximity points in reflexive Banach space
Unified Convergence Analysis of Certain At Least Fifth Order Methods
A set packing model for the Partition Coloring Problem
Cut-through connections of graphs
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter
