Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 71, 2022 - Issue 9
145
Views
6
CrossRef citations to date
0
Altmetric
Research Article

Regularization extragradient methods for equilibrium programming in Hilbert spaces

, , &
Pages 2643-2673 | Received 06 Oct 2020, Accepted 23 Dec 2020, Published online: 24 Jan 2021

References

  • Bigi G, Castellani M, Pappalardo M. Nonlinear programming techniques for equilibria. Cham: Springer; 2019.
  • Blum E, Oettli W. From optimization and variational inequalities to equilibrium problems. Math Stud. 1994;63:123–145.
  • Fan K. A minimax inequality and applications. In: Shisha O, editor. Inequality, III. New York: Academic Press; 1972. p. 103–113.
  • Konnov IV. Equilibrium models and variational inequalities. Amsterdam: Elsevier; 2007.
  • Muu LD, Oettli W. Convergence of an adaptive penalty scheme for finding constrained equilibria. Nonlin Anal TMA. 1992;18:1159–1166.
  • Hieu DV, Cho YJ, Xiao YB, et al. Modified extragradient method for pseudomonotone variational inequalities in infinite dimensional hilbert spaces. Vietnam J Math. 2020. DOI:10.1007/s10013-020-00447-7
  • Anh PK, Hai TN. Novel self-adaptive algorithms for non-lipschitz equilibrium problems with applications. J Glob Optim. 2019;73:637–657.
  • Bigi G, Passacantando M. Descent and penalization techniques for equilibrium problems with nonlinear constraints. J Optim Theory Appl. 2015;164:804–818.
  • Flam SD, Antipin AS. Equilibrium programming and proximal-like algorithms. Math Program. 1997;78:29–41.
  • Hieu DV. New subgradient extragradient methods for common solutions to equilibrium problems. Comput Optim Appl. 2017;67:571–594.
  • Hieu DV, Cho YJ, Xiao YB. Modified extragradient algorithms for solving equilibrium problems. Optim. 2018;67:2003–2029.
  • Hieu DV. An inertial-like proximal algorithm for equilibrium problems. Math Meth Oper Res. 2018;88:399–415.
  • Hieu DV. New inertial algorithm for a class of equilibrium problems. Numer Algor. 2019;80:1413–1436.
  • Lyashko SI, Semenov VV. Optimization and its applications in control and data sciences. Cham: Springer; 2016. p. 315–325.
  • Moudafi A. Proximal point algorithm extended to equilibrium problem. J Nat Geometry. 1999;15:91–100.
  • Quoc TD, Muu LD, Nguyen VH. Extragradient algorithms extended to equilibrium problems. Optim. 2008;57:749–776.
  • Santos P, Scheimberg S. An inexact subgradient algorithm for equilibrium problems. Comput Appl Math. 2011;30:91–107.
  • Hieu DV. An extension of hybrid method without extrapolation step to equilibrium problems. J Ind Manag Optim. 2017;13:1723–1741.
  • Hieu DV. Convergence analysis of a new algorithm for strongly pseudomontone equilibrium problems. Numer Algor. 2018;77:983–1001.
  • Hai TN. Convergence rate of a new projected-type algorithm solving non-lipschitz equilibrium problems. Comput Appl Math. 2020;39:52. DOI:10.1007/s40314-020-1062-7
  • Nguyen TTV, Strodiot JJ, Nguyen VH. Hybrid methods for solving simultaneously an equilibrium problem and countably many fixed point problems in a hilbert space. J Optim Theory Appl. 2014;160:809–831.
  • Vuong PT, Strodiot JJ, Hien NV. Extragradient methods and linesearch algorithms for solving ky fan inequalities and fixed point problems. J Optim Theory Appl. 2012;155:605–627.
  • Vuong PT, Strodiot JJ, Hien NV. On extragradient-viscosity methods for solving equilibrium and fixed point problems in a hilbert space. Optim. 2015;64:429–451.
  • Hieu DV, Strodiot JJ, Muu LD. Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems. J Comput Appl Math. 2020;376:112844. DOI:10.1016/j.cam.2020.112844
  • Hieu DV, Quy PK, Hong LT, et al. Accelerated hybrid methods for solving pseudomonotone equilibrium problems. Adv Comput Math. 2020;46:58. DOI:10.1007/s10444-020-09778-y
  • Hieu DV. Strong convergence of a new hybrid algorithm for fixed point problems and equilibrium problems. Math Modell Anal. 2019;24:1–19.
  • Murphy FH, Sherali HD, Soyster AL. A mathematical programming approach for determining oligopolistic market equilibrium. Math Program. 1982;24:92–106.
  • Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in hilbert spaces. New York: Springer; 2011.
  • Cottle RW, Yao JC. Pseudo-monotone complementarity problems in hilbert space. J Optim Theory Appl. 1992;75:281–295.
  • Xu HK. Another control condition in an iterative method for nonexpansive mappings. Bull Austral Math Soc. 2002;65:109–113.
  • Hung PG, Muu LD. The tikhonov regularization extended to equilibrium problems involving pseudomonotone bifunctions. Nonlinear Anal. 2011;74:6121–6129.
  • Hung PG, Muu LD. On inexact tikhonov and proximal point regularization methods for pseudomonotone equilibrium problems. Vietnam J Math. 2012;40:255–274.
  • Konnov IV. Regularization methods for nonmonotone equilibrium problems. J Nonlin Convex Anal. 2009;10:93–101.
  • Oliveira PR, Santos P, Silva AN. A tikhonov-type regularization for equilibrium problems in hilbert spaces. J Math Anal Appl. 2013;401:336–342.
  • Hieu DV, Quy PK, Lv Vy. Explicit iterative algorithms for solving equilibrium problems. Calcolo. 2019;56:1. DOI:10.1007/s10092-019-0308-5
  • Khoroshilova EV. Extragradient-type method for optimal control problem with linear constraints and convex objective function. Optim Lett. 2013;7:1193–1214.
  • Seydenschwanz M. Convergence results for the discrete regularization of linear-quadratic control problems with bang-bang solutions. Comput Optim Appl. 2015;629:731–760.
  • Hieu DV, Muu LD, Duong HN. Iterative regularization methods for solving equilibrium problems. Comput Optim Appl. 2020.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.