Stepsize Choice for Korpelevich's and Popov's Extragradient Algorithms for Convex-Concave Minimax Problems

IF 1.4 4区数学 Q1 MATHEMATICS

Carpathian Journal of Mathematics Pub Date : 2022-07-30 DOI:10.37193/cjm.2023.01.22

Jiaojiao Wang, H. Xu

引用次数: 0

Abstract

"We 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."

查看原文本刊更多论文

凸凹极大极小问题的Korpelevich和Popov超梯度算法的步长选择

“我们证明了Korpelevich超梯度算法中步长的选择是尖锐的，而Popov超梯度算法的步长选择是可以放松的。我们还将Korpelewich超梯度和Popov（步长较大）超梯度算法扩展到无穷维Hilbert空间框架中，具有弱收敛性。”

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Carpathian Journal of Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.40

自引率

7.10%

发文量

审稿时长

>12 weeks

期刊介绍： Carpathian Journal of Mathematics publishes high quality original research papers and survey articles in all areas of pure and applied mathematics. It will also occasionally publish, as special issues, proceedings of international conferences, generally (co)-organized by the Department of Mathematics and Computer Science, North University Center at Baia Mare. There is no fee for the published papers but the journal offers an Open Access Option to interested contributors.