Inertial proximal point algorithm for variational inclusion in Hadamard manifolds

Tseng‐Type Algorithms for the Split Variational Inclusion

“…Variational inclusion is at the core of the modeling of many problems, such as variational inequalities [2][3][4], optimization problems [5], split problems [6][7][8][9], equilibrium problems [10], and xed point problems [11]. Variational inclusion (1) has been extended and studied in di erent ways, see [12][13][14][15][16][17][18]. An e cient way for solving (1) is the forward-backward iterate [19][20][21] de ned by…”

Common solutions of a finite family of minimization problems and fixed point problems in Hadamard manifolds

“…Recently, many convergence results by the proximal point algorithm have been extended from the classical linear spaces to the setting of manifolds; see, e.g., [1,2,3,4,7,8,9,10,11,13,15,20,21,22] and the references therein.…”

“…Recently, Chang et al [8] proposed a new algorithm and proved that the sequence generalized by the algorithm converges strongly to a common element of the set of fixed points of a quasipseudo-contractive mapping and a demi-contraction mapping and the set of zeros of monotone inclusion problems on Hadamard manifolds. At the same time, Chang et al [10] considered the inertial proximal point algorithm for finding a zero point of variational inclusions on Hadamard manifolds.…”