Research article

New extrapolation projection contraction algorithms based on the golden ratio for pseudo-monotone variational inequalities

  • Received: 16 May 2023 Revised: 26 June 2023 Accepted: 06 July 2023 Published: 24 July 2023
  • MSC : 47H05, 47J20, 47J25, 65K15, 90C25

  • In real Hilbert spaces, for the purpose of trying to deal with the pseudo-monotone variational inequalities problem, we present a new extrapolation projection contraction algorithm based on the golden ratio in this study. Unlike ordinary inertial extrapolation, the algorithms are constructed based on a convex combined structure about the entire iterative trajectory. Extrapolation parameter $ \psi $ is selected in a more relaxed range instead of only taking the golden ratio $ \phi = \frac{\sqrt{5}+1 }{2} $ as the upper bound. Second, we propose an alternating extrapolation projection contraction algorithm to better increase the convergence effects of the extrapolation projection contraction algorithm based on the golden ratio. All our algorithms employ non-constantly decreasing adaptive step-sizes. The weak convergence results of the two algorithms are established for the pseudo-monotone variational inequalities. Additionally, the R-linear convergence results are investigated for strongly pseudo-monotone variational inequalities. Finally, we show the validity and superiority of the suggested methods with several numerical experiments. The numerical results show that alternating extrapolation does have obvious acceleration effect in practical application compared with no alternating extrapolation. Thus, the obvious effect of relaxing the selection range of parameter $ \psi $ on our two algorithms is clearly demonstrated.

    Citation: Cuijie Zhang, Zhaoyang Chu. New extrapolation projection contraction algorithms based on the golden ratio for pseudo-monotone variational inequalities[J]. AIMS Mathematics, 2023, 8(10): 23291-23312. doi: 10.3934/math.20231184

    Related Papers:

  • In real Hilbert spaces, for the purpose of trying to deal with the pseudo-monotone variational inequalities problem, we present a new extrapolation projection contraction algorithm based on the golden ratio in this study. Unlike ordinary inertial extrapolation, the algorithms are constructed based on a convex combined structure about the entire iterative trajectory. Extrapolation parameter $ \psi $ is selected in a more relaxed range instead of only taking the golden ratio $ \phi = \frac{\sqrt{5}+1 }{2} $ as the upper bound. Second, we propose an alternating extrapolation projection contraction algorithm to better increase the convergence effects of the extrapolation projection contraction algorithm based on the golden ratio. All our algorithms employ non-constantly decreasing adaptive step-sizes. The weak convergence results of the two algorithms are established for the pseudo-monotone variational inequalities. Additionally, the R-linear convergence results are investigated for strongly pseudo-monotone variational inequalities. Finally, we show the validity and superiority of the suggested methods with several numerical experiments. The numerical results show that alternating extrapolation does have obvious acceleration effect in practical application compared with no alternating extrapolation. Thus, the obvious effect of relaxing the selection range of parameter $ \psi $ on our two algorithms is clearly demonstrated.



    加载中


    [1] D. V. Thong, D. V. Hieu, Inertial extragradient algorithms for strongly pseudomonotone variational inequalities, J. Comput. Appl. Math., 341 (2018), 80–98. https://doi.org/10.1016/j.cam.2018.03.019 doi: 10.1016/j.cam.2018.03.019
    [2] P. K. Anh, D. V. Thong, N. T. Vinh, Improved inertial extragradient methods for solving pseudo-monotone variational inequalities, Optimization, 71 (2020), 505–528. https://doi.org/10.1080/02331934.2020.1808644 doi: 10.1080/02331934.2020.1808644
    [3] P. Q. Khanh, D. V. Thong, N. T. Vinh, Versions of the subgradient extragradient method for pseudomonotone variational inequalities, Acta Appl. Math., 170 (2020), 319–345. https://doi.org/10.1007/s10440-020-00335-9 doi: 10.1007/s10440-020-00335-9
    [4] S. Reich, D. V. Thong, Q. L. Dong, X. H. Li, V. T. Dung, New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings, Numer. Algorithms, 87 (2021), 527–549. https://doi.org/10.1007/s11075-020-00977-8 doi: 10.1007/s11075-020-00977-8
    [5] F. Facchinei, J. S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, In: Springer Series in Operations Research, New York: Springer, 2003.
    [6] I. Konnov, Combined relaxation methods for variational inequalities, Berlin: Springer-Verlag, 2001.
    [7] G. M. Korpelevich, The extragradient method for finding saddle points and other problems, Matecon, 12 (1976), 747–756.
    [8] Y. Censor, A. Gibali, S. Reich, The subgradient extragradient method for solving variational inequalities in Hilbert space, J. Optim. Theory Appl., 148 (2011), 318–335. https://doi.org/10.1007/s10957-010-9757-3 doi: 10.1007/s10957-010-9757-3
    [9] Y. Censor, A. Gibali, S. Reich, Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space, Optim. Method. Softw., 26 (2011), 827–845. https://doi.org/10.1080/10556788.2010.551536 doi: 10.1080/10556788.2010.551536
    [10] Y. Censor, A. Gibali, S. Reich, Extensions of Korpelevich's extragrsient method for the variational inequality problem in Euclidean space, Optimization, 61 (2012), 1119–1132. https://doi.org/10.1080/02331934.2010.539689 doi: 10.1080/02331934.2010.539689
    [11] B. S. He, A class of projection and contraction methods for monotone variational inequalities, Appl. Math. Optim., 35 (1997), 69–76.
    [12] X. J. Cai, G. Y. Gu, B. S. He, On the $O(1/t)$ convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators, Comput. Optim. Appl., 57 (2014), 339–363. https://doi.org/10.1007/s10589-013-9599-7 doi: 10.1007/s10589-013-9599-7
    [13] Q. L. Dong, Y. J. Cho, L. L. Zhong, T. M. Rassias, Inertial projection and contraction algorithms for variational inequalities, J. Global Optim., 70 (2018), 687–704. https://doi.org/10.1007/s10898-017-0506-0 doi: 10.1007/s10898-017-0506-0
    [14] Q. L. Dong, Y. J. Cho, T. M. Rassias, The projection and contraction methods for finding common solutions to variational inequality problems, Optim. Lett., 12 (2018), 1871–1896. https://doi.org/10.1007/s11590-017-1210-1 doi: 10.1007/s11590-017-1210-1
    [15] Y. Shehu, O. S. Iyiola, Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence, Appl. Numer. Math., 157 (2020), 315–337. https://doi.org/10.1016/j.apnum.2020.06.009 doi: 10.1016/j.apnum.2020.06.009
    [16] Y. Malitsky, Golden ratio algorithms for variational inequalities, Math. Program., 184 (2018), 383–410. https://doi.org/10.1007/s10107-019-01416-w doi: 10.1007/s10107-019-01416-w
    [17] D. V. Thong, N. T. Vinh, Y. J. Cho, New strong convergence theorem of the inertial projection and contraction method for variational inequality problems, Numer. Algorithms, 84 (2019), 285–305. https://doi.org/10.1007/s11075-019-00755-1 doi: 10.1007/s11075-019-00755-1
    [18] P. Cholamjiak, D. V. Thong, Y. J. Cho, A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems, Acta Appl. Math., 169 (2019), 217–245. https://doi.org/10.1007/s10440-019-00297-7 doi: 10.1007/s10440-019-00297-7
    [19] X. K. Chang, J. F. Yang, A golden ratio primal-dual algorithm for structured convex optimization, J. Sci. Comput., 87 (2021), 47. https://doi.org/10.1007/s10915-021-01452-9 doi: 10.1007/s10915-021-01452-9
    [20] X. K. Chang, J. F. Yang, H. C. Zhang, Golden ratio primal-dual algorithm with linesearch, SIAM J. Optim., 32 (2022), 1584–1613. https://doi.org/10.1137/21M1420319 doi: 10.1137/21M1420319
    [21] H. H. Bauschke, P. L. Combettes, Convex analysis and monotone operator theory in Hilbert spaces, New York: Springer, 2011.
    [22] K. Goebel, S. Reich, Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, New York: Marcel Dekker, 1984.
    [23] J. M. Ortega, W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables, New York: Academic Press, 1970.
    [24] J. Mashreghi, M. Nasri, Forcing strong convergence of Korpelevich's method in Banach spaces with its applications in game theory, Nonlinear Anal., 72 (2010), 2086–2099. https://doi.org/10.1016/j.na.2009.10.009 doi: 10.1016/j.na.2009.10.009
    [25] G. L. Acedo, H. K. Xu, Iterative methods for strict pseudo-contractions in Hilbert spaces, Nonlinear Anal., 67 (2007), 2258–2271. https://doi.org/10.1016/j.na.2006.08.036 doi: 10.1016/j.na.2006.08.036
    [26] M. O. Osilike, S. C. Aniagbosor, Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings, Math. Comput. Modell., 32 (2000), 1181–1191. https://doi.org/10.1016/S0895-7177(00)00199-0 doi: 10.1016/S0895-7177(00)00199-0
    [27] Y. Shehu, Q. L. Dong, L. L. Liu, Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities, J. Comput. Appl. Math., 415 (2022), 114517. https://doi.org/10.1016/j.cam.2022.114517 doi: 10.1016/j.cam.2022.114517
    [28] P. T. Harker, J.-S. Pang, A damped-Newton method for the linear complementarity problem, in: Computational Solution of Nonlinear Systems of Equations (Fort Collins, CO, 1988), In: Lectures in Applied Mathematics, 1990.
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(760) PDF downloads(72) Cited by(0)

Article outline

Figures and Tables

Figures(4)  /  Tables(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog