arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.04013math.OC
收藏

求解均衡问题的改进黄金比例算法

Modified golden ratio algorithms for solving equilibrium problems

Dang Van Hieu, Jean Jacques Strodiot, Le Dung Muu

摘要:

本文提出了一个求解双函数为伪单调且满足Lipschitz型条件的平衡问题的显式算法。与许多算法相反,我们的算法没有显式使用双函数的Lipschitz常数,尽管在这种条件下获得了收敛性。所介绍的方法是一种形式的近似方法,其步长显式地产生在每次迭代,而不使用任何线的程序。首先证明了算法的收敛性,然后在双函数强伪单调性的假设下,建立了算法的$R$ -线性收敛速率。之后,一些数值结果显示,以说明和比较的行为的新算法与其他的。

英文摘要:

In this paper an explicit algorithm is proposed for solving an equilibrium problem whose associated bifunction is pseudomonotone and satisfies a Lipschitz-type condition. Contrary to many algorithms, our algorithm is done without using explicitly the Lipschitz constants of bifunction although its convergence is obtained under such that condition. The introduced method is a form of proximal-like method whose steplengths are explicitly generated at each iteration without using any linesearch procedure. First we prove the convergence of the algorithm, and after we establish its $R$-linear rate of convergence under the assumption of strong pseudomonotonicity of the bifunction. Afterwards several numerical results are displayed to illustrate and to compare the behavior of the new algorithm with other ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑