Abstract
In this paper, basing on the forward-backward method and inertial techniques, we introduce a new algorithm for solving a variational inequality problem over the fixed point set of a nonexpansive mapping. The strong convergence of the algorithm is established under strongly monotone and Lipschitz continuous assumptions imposed on the cost mapping. As an application, we also apply and analyze our algorithm to solve a convex minimization problem of the sum of two convex functions.
Similar content being viewed by others
References
Alvarez, F.: Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space. SIAM J. Optim. 14, 773–782 (2004)
Anh, P.N., Hien, N.D., Phuong, N.X., Ngoc, V.T.: Parallel subgradient methods for variational inequalities involving nonexpansive mappings. Appl. Anal. https://doi.org/10.1080/00036811.2019.1584288 (2019)
Anh, P.N., Le Thi, H.A.: New subgradient extragradient methods for solving monotone bilevel equilibrium problems. Optim. 68(1), 2097–2122 (2019)
Anh, P.N., Kim, J.K., Muu, L.D.: An extragradient method for solving bilevel variational inequalities. J. Glob. Optim. 52, 627–639 (2012)
Beck, A.: First-order Methods in Optimization. MOS-SIAM Series on Optimization, Chapter 6 (2017)
Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sc. 2, 183–202 (2009)
Bot, R.I., Csetnek, E.R., Laszlo, S.C.: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 4, 3–25 (2016)
Bussaban, L., Suantai, S., Kaewkhao, A.: A parallel inertial S-iteration forward-backward algorithm for regression and classification problems. Carpathian J. Math. 36, 35–44 (2020)
Chbani, Z., Riahi, H.: Weak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities. Optim. Lett. 7, 185–206 (2013)
Duc, P.M., Muu, L.D.: A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings. Optim. 65(10), 1855–1866 (2016)
Iiduka, H., Yamada, I.: A Subgradient-type method for the equilibrium problem over the fixed point set and its applications. Optim. 58, 251–261 (2009)
Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic Press (1980)
Konnov, I. V.: Combined Relaxation Methods for Variational Inequalities. Springer-Verlag, Berlin (2000)
Liu, F., Nashed, M.Z.: Regularization of nonlinear ill-posed variational inequalities and convergence rates. Set-Valued Anal. 6, 313–344 (1998)
Lorenz, D.A., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51, 311–325 (2015)
Londono, G., Lozano, A.: A bilevel optimization program with equilibrium constraints for an urban network dependent on time. Transp. Res. Proc. 3, 905–914 (2014)
Marcotte, P.: Network design problem with congestion effects: A case of bilevel programming. Math. Progr. 34(2), 142–162 (1986)
Moudafi, A.: Krasnoselski–Mann iteration for hierarchical fixed-point problems. Inverse Prob. 23, 1635–1640 (2007)
Nakajo, K., Shimoji, K., Takahashi, W.: On strong convergence by the hybrid method for families of mappings in Hilbert spaces. Nonl. Anal. Theory, Meth. Appl. 71(1–2), 112–119 (2009)
Saejung, S., Yotkaew, P.: Approximation of zeros of inverse strongly monotone operators in Banach spaces. Nonl. Anal. 75, 724–750 (2012)
Solodov, M.: An explicit descent method for bilevel convex optimization. J. Conv. Anal. 14, 227–237 (2007)
Xu, M. H., Li, M., Yang, C.C.: Neural networks for a class of bilevel variational inequalities. J. Glob. Optim. 44, 535–552 (2009)
Yao, Y., Marino, G., Muglia, L.: A modified Korpelevichś method convergent to the minimum-norm solution of a variational inequality. Optim. 63, 559–569 (2014)
Yamada, I.: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. Stud. Comput. Math. 8, 473–504 (2001)
Yamada, I., Ogura, N.: Hybrid steepest descent method for the variational inequality problem over the the fixed point set of certain quasi-nonexpansive mappings. Numer. Funct. Anal. Optim. 25, 619–655 (2004)
Acknowledgements
We are very grateful to anonymous referees for their really helpful and constructive comments that helped us very much in improving the paper.
Funding
This research is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant Number 101.02-2019.303.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Anh, P.N. Hybrid Inertial Contraction Algorithms for Solving Variational Inequalities with Fixed Point Constraints in Hilbert Spaces. Acta Math Vietnam 47, 743–753 (2022). https://doi.org/10.1007/s40306-021-00467-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40306-021-00467-6
Keywords
- Variational inequality problem
- Fixed point constraints
- Lipschitz continuous
- Strongly monotone
- Forward-backward method