Mildly Inertial Subgradient Extragradient Method for Variational Inequalities Involving an Asymptotically Nonexpansive and Finitely Many Nonexpansive Mappings

In a real Hilbert space, let the notation VIP indicate a variational inequality problem for a Lipschitzian, pseudomonotone operator, and let CFPP denote a common fixed-point problem of an asymptotically nonexpansive mapping and finitely many nonexpansive mappings. This paper introduces mildly inertial algorithms with linesearch process for finding a common solution of the VIP and the CFPP by using a subgradient approach. These fully absorb hybrid steepest-descent ideas, viscosity iteration ideas, and composite Mann-type iterative ideas. With suitable conditions on real parameters, it is shown that the sequences generated our algorithms converge to a common solution in norm, which is a unique solution of a hierarchical variational inequality (HVI).