Two regularized inertial Tseng methods for solving inclusion problems with applications to convex bilevel programming

References

• Taiwo A, Reich S. Bounded perturbation resilience of a regularized forward-reflected-backward splitting method for solving variational inclusion problems with applications. Optimization. 2023: 34 pp.
   Web of Science ®Google Scholar
• Beck A, Teboulle M. Gradient-based algorithms with applications to signal recovery problems. In: Palomar PD, Eldar E, editors. Convex optimization in signal processing and communications. Cambridge, UK: Cambridge University Press; 2009.
   Google Scholar
• Alber Y, Ryazantseva I. Nonlinear Ill-posed problems of monotone type. Dordrecht: Springer; 2006.
   Google Scholar
• Lions PL, Mercier B. Splitting algorithms for the sum of two nonlinear operators. SIAM J Numer Anal. 1979;16:964–979. doi: 10.1137/0716071
   Web of Science ®Google Scholar
• Chen GH, Rockafellar RT. Convergence rates in forward-backward splitting. SIAM J Optim. 1997;7:421–444. doi: 10.1137/S1052623495290179
   Web of Science ®Google Scholar
• Tseng P. A modified forward–backward splitting method for maximal monotone mappings. SIAM J Control Optim. 2000;38:431–446. doi: 10.1137/S0363012998338806
   Web of Science ®Google Scholar
• Tan B, Cho SY. Strong convergence of inertial forward–backward methods for solving monotone inclusions. Appl Anal. 2022;101(15):5386–5414. doi: 10.1080/00036811.2021.1892080
   Web of Science ®Google Scholar
• Cholamjiak P, Hieu DV, Cho YJ. Relaxed forward–backward splitting methods for solving variational inclusions and applications. J Sci Comput. 2021;88(3):23. doi:10.1007/s10915-021-01608-7.
   Web of Science ®Google Scholar
• Gibali A, Thong DV. Tseng type methods for solving inclusion problems and its applications. Calcolo. 2018;55(4):1–22. doi: 10.1007/s10092-018-0292-1
   Web of Science ®Google Scholar
• Suparatulatorna R, Chaichana K. A strongly convergent algorithm for solving common variational inclusion with application to image recovery problems. Appl Numer Math. 2022;173:239–248. doi: 10.1016/j.apnum.2021.12.006
   Web of Science ®Google Scholar
• Polyak BT. Some methods of speeding up the convergence of iteration methods. USSR Comput Math Math Phys. 1944;4(5):1–17. doi: 10.1016/0041-5553(64)90137-5
   Google Scholar
• Alvarez F, Attouch H. An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 2001;9:3–11. doi: 10.1023/A:1011253113155
   Google Scholar
• Alakoya TO, Uzor VA, Mewomo OT. A new projection and contraction method for solving monotone variational inclusion, pseudomonotone variational inequality, and common fixed point problems. Comput Appl Math. 2023;42(1):33. doi: 10.1007/s40314-022-02138-0
   Google Scholar
• Kesornprom S, Cholamjiak P. A modified inertial proximal gradient method for minimization problems and applications. AIMS Math. 2022;7(5):8147–8161. doi: 10.3934/math.2022453
   Web of Science ®Google Scholar
• Reich S, Taiwo A. Fast hybrid iterative schemes for solving variational inclusion problems. Math Methods Appl Sci. 2023;46(16):17177–17198.
   Google Scholar
• Godwin EC, Izuchukwu C, Mewomo OT. Image restoration using a modified relaxed inertial method for generalized split feasibility problems. Math Methods Appl Sci. 2023;46(5):5521–5544. doi: 10.1002/mma.v46.5
   Web of Science ®Google Scholar
• Suantai S, Pholasa N, Cholamjiak P. Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems. Rev Real Acad Cienc Exactas Fis Nat A Mat. 2019;113:1081–1099. doi: 10.1007/s13398-018-0535-7
   Web of Science ®Google Scholar
• Taiwo A, Mewomo OT. Inertial viscosity method with alternative regularization for certain optimization and fixed point problems. J Appl Numer Optim. 2022;4:405–423.
   Google Scholar
• Browder FE. Nonlinear mappings of nonexpansive and accretive-type in Banach spaces. Bull Am Math Soc. 1967;73:875–882. doi: 10.1090/bull/1967-73-06
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. Springer; 2011. (CMS books in mathematics).
   Google Scholar
• Brézis H. Operateurs maximaux monotones. North-Holland, Amsterdam; 1973.
   Google Scholar
• Yamada I. The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. Inherently parallel algorithms in feasibility and optimization and their applications. Stud Comput Math. 2001;8:473–504.
   Google Scholar
• Maingé PE. Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces. J Math Anal Appl. 2007;325(1):469–479. doi: 10.1016/j.jmaa.2005.12.066
   Web of Science ®Google Scholar
• Saejung S, Yotkaew P. Approximation of zeros of inverse strongly monotone operators in Banach spaces. Nonlinear Anal. 2012;75:742–750. doi: 10.1016/j.na.2011.09.005
   Web of Science ®Google Scholar
• Hieu DV, Anh PK, Ha NH. Regularization proximal method for monotone variational inclusions. Netw Spat Econ. 2021;21:905–932. doi: 10.1007/s11067-021-09552-7
   Web of Science ®Google Scholar
• Wang Z, Lei Z, Long X, et al. Tseng splitting method with double inertial steps for solving monotone inclusion problems; 2022. arXiv:2209.11989v1 [mathOC].
   Google Scholar
• Taiwo A, Mewomo OT, Gibali A. A simple strong convergent method for solving split common fixed point problems. J Nonlinear Var Anal. 2021;5(5):777–793.
   Web of Science ®Google Scholar
• Moudafi A. Viscosity approximation methods for fixed-points problems. J Math Anal Appl. 2000;241(1):46–55. doi: 10.1006/jmaa.1999.6615
   Web of Science ®Google Scholar
• Suantai S, Pholasa N, Cholamjiak P. The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J Ind Manag Optim. 2018;14(4):1595–1615. doi: 10.3934/jimo.2018023
   Google Scholar
• Dempe S, Dinh N, Dutta J. Optimality conditions for a simple convex bilevel programming problem. In: Burachik RS, Yao JC, editors. Variational analysis and generalized differentiation in optimization and control. New York: Springer; 2010. p. 14–161.
   Google Scholar
• Dutta J, Pandit T. Algorithms for simple bilevel programming. Springer International Publishing: Cham; 2020. p. 253–291–
   Google Scholar
• Doron L, Shtern S. Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems. Math Program. 2023; Ser. A. 201(1-2):521–558.
   Web of Science ®Google Scholar
• Beck A, Sabach S. A first order method for finding minimal norm-like solutions of convex optimization problems. Math Program. 2014;147:25–46. doi: 10.1007/s10107-013-0708-2
   Web of Science ®Google Scholar
• Sabach S, Shtern S. A first order method for solving convex bilevel optimization problems. SIAM J Optim. 2017;27:640–660. doi: 10.1137/16M105592X
   Web of Science ®Google Scholar
• Shehu Y, Vuong PT, Zemkoho A. An inertial extrapolation method for convex simple bilevel optimization. Optim Methods Softw. 2021;36(1):1–19. doi: 10.1080/10556788.2019.1619729
   Web of Science ®Google Scholar
• Peypouquet J. Convex optimization in normed spaces: theory, methods and examples. SpringerBriefs in Optimization; 2015. ISBN 978-3-319-13709-4 ISBN 978-3-319-13710-0 (eBook).
   Google Scholar
• Hieu DV, Moudafi A. Regularization projection method for solving bilevel variational inequality problem. Optim Lett. 2021;15:205–229. doi: 10.1007/s11590-020-01580-5
   Web of Science ®Google Scholar
• Gibali A, Shehu Y. A symmetric FBF method for solving monotone inclusions. Symmetry. 2020;12(9):1456. doi: 10.3390/sym12091456
   Google Scholar