Abstract
In this article, we investigate monotone and Lipschitz continuous variational inclusion problem in the settings of Hadamard manifolds. We propose a forward–backward method with a self-adaptive technique for solving variational inclusion problem. To increase the rate of convergence of our proposed method, we incorporate our iterative method with double inertial steps and establish a convergence result of our iterative method under some mild conditions. Finally, in order to illustrate the computational effectiveness of our method, some numerical examples are also discussed. The result present in this article is new in this space and extends many related results in the literature.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(\mathcal {K}\) be a nonempty, closed geodesic convex subset of a Hadamard manifold \(\mathbb {P},~ T_{x}\mathbb {P}\) be the tangent space of \(\mathbb {P}\) at \(x \in \mathbb {P}\) and \(T\mathbb {P}\) be the tangent bundle of \(\mathbb {P}\). The variational inclusion problem (VIP) is to find \(\overline{x} \in \mathbb {P}\) such that
where \(\Phi : \mathcal {K} \rightarrow T \mathbb {P}\) is a single-valued vector field, \(\Psi : \mathcal {K} \rightarrow 2^{T\mathbb {P}}\) is a multi-valued vector field and 0 denotes the zero section of \(T\mathbb {P}\). We denote the solution set of (1) by \(\Omega \). The variational inclusion problem has received much attention due to its various applications in signal processing, image recovery and statistical regression, (see [3, 13, 44, 47, 49]). It is known that several optimization problem such as convex optimization problem can be translated into finding a zero of a maximal monotone operator defined on a Hilbert space \(\mathbb {M}\). The problem of finding a zero of the sum of two (maximal) monotone operators is of fundamental importance in convex optimization and variational analysis (see [1, 19, 26, 33, 43, 52]). For solving VIP (1), the forward–backward splitting method (FBM) (see [13, 28, 29, 48]) is usually employed and is defined in the following manner: \(q_1 \in \mathbb {M}\) and
where \(r > 0, ~\Psi : \mathbb {M} \rightarrow 2^{\mathbb {M}}\) is a set-valued operator and \(\Phi : \mathbb {M} \rightarrow \mathbb {M}\) is an operator. In this case, each step of iterates involves only with \(\Phi \) as the forward step and \(\Psi \) as the backward step, but not the sum of operators. The FBM defined in (2) above requires one of the operators to be inverse strongly monotone. This assumption imposed on one of the operators is very difficult to meet the practical problems. In order to dispense with the condition, many authors have introduced several iterative methods. For instance, Tseng [48] introduced the following forward–backward–forward method which is a two-step iterative scheme as follows:
where the step size \(\{r_k\}\) can be updated by Armijo linesearch methods. When the mapping \(\Phi \) is Lipschitz continuous and the mapping \(\Psi \) is maximal monotone, (3) converges weakly to a solution of VIP in the settings of real Hilbert spaces.
In 2019, Shehu [41] extended Tseng’s splitting method to the settings of real Banach spaces. He proposed the following iterative method for approximating solution of VIP in a 2-uniformly convex Banach space \(\mathbb {E}\) which is also uniformly smooth as follows:
where \(\Phi : \mathbb {E} \rightarrow \mathbb {E}\) is monotone and L-Lipschitz continuous, \(J_{r_k}^{\Psi }=(J+ r_k \Psi )^{-1}J\) is the resolvent of \(\Psi \) and J is the duality mapping from \(\mathbb {E}\) to \(\mathbb {E}^{*}\) (\(\mathbb {E}^*\) is the dual of \(\mathbb {E}\)). He obtained a weak convergence result.
In 1964, Polyak [38] introduced the inertial extrapolation method which is a useful tool for speeding up the rate of convergence of iterative methods. The idea of inertial extrapolation method was inspired by an implicit discretization of a second-order in-time dissipative dynamical system, so-called heavy ball with friction. The heavy ball friction is a simplified version of the differential system describing the motion of a heavy ball that rolls over the graph f and that keep rolling under its own inertia until friction stop it at a critical point of f. This nonlinear oscillation with damping, which is called the "heavy ball with friction" system, has been considered by several authors from the optimization point of view, establishing different convergence results and identifying circumstances under which the rate of convergence is better than the one of the first-order-steepest descent method (see [4, 6, 38]). Alvarez and Attouch [5] introduced and constructed the heavy-ball method with the proximal point algorithm to solve a problem of maximal monotone operator. They defined their method as follows:
where \(\{\theta _{k}\} \subset [0,1)\) and \(\{r_k\}\) is nondecreasing with \(\sum \limits _{k=1}^{\infty }\theta _k\Vert q_k-q_{k-1}\Vert < \infty .\) They established that the sequence generated by (5) converges weakly to a zero of the monotone operator \(\Psi \). In 2003, Moudafi and Oliny [32] introduced the following inertial proximal point method for finding the zero of the sum of two monotone operators:
They obtained a weak convergence theorem provided that \(r_k < \frac{2}{L}\) with L being the Lipschitz constant of \(\Phi \) and \(\sum \limits _{k=1}^{\infty }\theta _{k}\Vert q_{k}-q_{k-1}\Vert < \infty \) holds. Polyak [37] explored the potential of enhancing the convergence speed of numerical iteration methods for solving optimization problems by incorporating multistep inertial extrapolation steps. However, it is important to note that [37, 39] do not provide an established convergence analysis or rate of convergence for these multi-step inertial methods. Thus, the use of two or more inertial terms could guarantee necessary acceleration (see [30]). For growing interests in this direction (see [1, 2, 24, 51]).
Recently, Dong et al. [16] introduced the double inertial Mann algorithm and proved the convergence of the proposed algorithm under some suitable conditions: the algorithm is given by
where T is a nonexpansive mapping, \(\lambda , \theta \in [0,1]\) and \(\phi \in (0,1).\)
Very recently, Suantai et al. [45] also considered a double inertial forward–backward algorithm in the settings of real Hilbert spaces.
Extension of concepts and techniques from linear spaces to Riemannian manifolds has some important advantages (see [17, 22, 40]). For instance, some optimization problems with nonconvex objective functions become convex from the Riemannian geometry point of view, and some constrained optimization problems can be regarded as unconstrained ones with an appropriate Riemannian metric. In addition, the study of convex minimization problems and inclusion problems in nonlinear spaces have proved to be very useful in computing medians and means of trees, which are very important in computational phylogenetics, diffusion tensor imaging, consensus algorithms and modeling of airway systems in human lungs and blood vessels (see [9,10,11]). Thus, nonlinear spaces are more suitable frameworks for the study of optimization problems from linear to Riemannian manifolds.
Very recently, Khammahawong et al. [20] proposed the following forward–backward splitting method for solving variational inclusion problem (1) in the settings of a Hadamard manifold:
where
and \(\mu > 0.\) They proved that the sequence by their proposed method converges to an element in \(\Omega \).
Furthermore, it will be crucial to expand the idea of the double inertial method to the Hadamard manifold because of the significance of our space of interest and the importance of the inertial method in dynamical systems.
Motivated by the aforementioned results in linear and nonlinear spaces, we proposed a forward–backward method together with a double step inertial method for solving variational inclusion problem in the settings of a Hadamard manifold. We prove that the sequence generated by our method converges to a solution of VIP (1) without the prior knowledge of the Lipschitz constant via a self-adaptive technique. In order to fasten the rate of convergence of our proposed method, we introduce a double inertial steps. Lastly, we compare our results with some related results in the literature to show the performance of our method. To the best of our knowledge, no result on double inertial steps have been discussed in the settings of nonlinear spaces. Our result extends and generalizes many related results in the literature.
2 Preliminaries
Let \(\mathbb {P}\) be an m-dimensional manifold, let \(x \in \mathbb {P}\) and let \(T_x \mathbb {P}\) be the tangent space of \(\mathbb {P}\) at \(x \in \mathbb {P}\). We denote by \(T\mathbb {P}=\bigcup _{x \in \mathbb {P}}T_x \mathbb {P}\) the tangent bundle of \(\mathbb {P}\). An inner product \(\mathcal {R}\langle \cdot , \cdot \rangle \) is called a Riemannian metric on \(\mathbb {P}\) if \(\langle \cdot ,\cdot \rangle _x:T_x \mathbb {P} \times T_x \mathbb {P} \rightarrow \mathbb {R}\) is an inner product for all \(x \in \mathbb {P}.\) The corresponding norm induced by the inner product \(\mathcal {R}_x \langle \cdot ,\cdot \rangle \) on \(T_x \mathbb {P}\) is denoted by \(\Vert \cdot \Vert _x.\) We will drop the subscript x and adopt \(\Vert \cdot \Vert \) for the corresponding norm induced by the inner product. A differentiable manifold \(\mathbb {P}\) endowed with a Riemannian metric \(\mathcal {R}\langle \cdot ,\cdot \rangle \) is called a Riemannian manifold. In what follows, we denote the Riemannian metric \(\mathcal {R} \langle \cdot ,\cdot \rangle \) by \(\langle \cdot ,\cdot \rangle \) when no confusion arises. Given a piecewise smooth curve \(\gamma :[a,b] \rightarrow \mathbb {P}\) joining x to y (that is, \(\gamma (a)=x\) and \(\gamma (b)=y\)), we define the length \(l(\gamma )\) of \(\gamma \) by \(l(\gamma ):= \int _{a}^{b}\Vert \gamma ^{\prime }(t)\Vert \textrm{d}t\). The Riemannian distance d(x, y) is the minimal length over the set of all such curves joining x to y. The metric topology induced by d coincides with the original topology on \(\mathbb {P}\). We denote by \(\nabla \) the Levi-Civita connection associated with the Riemannian metric [40].
Let \(\gamma \) be a smooth curve in \(\mathbb {P}\). A vector field X along \(\gamma \) is said to be parallel if \(\nabla _{\gamma ^{\prime }}X=\textbf{0}\), where \(\textbf{0}\) is the zero tangent vector. If \(\gamma ^{\prime }\) itself is parallel along \(\gamma \), then we say that \(\gamma \) is a geodesic and \(\Vert \gamma ^{\prime }\Vert \) is a constant. If \(\Vert \gamma ^{\prime }\Vert =1\), then the geodesic \(\gamma \) is said to be normalized. A geodesic joining x to y in \(\mathbb {P}\) is called a minimizing geodesic if its length equals d(x, y). A Riemannian manifold \(\mathbb {P}\) equipped with a Riemannian distance d is a metric space \((\mathbb {P},d)\). A Riemannian manifold \(\mathbb {P}\) is said to be complete if for all \(x \in \mathbb {P}\), all geodesics emanating from x are defined for all \(t \in \mathbb {R}\). The Hopf–Rinow theorem [40] posits that if \(\mathbb {P}\) is complete, then any pair of points in \(\mathbb {P}\) can be joined by a minimizing geodesic. Moreover, if \((\mathbb {P},d)\) is a complete metric space, then every bounded and closed subset of \(\mathbb {P}\) is compact. If \(\mathbb {P}\) is a complete Riemannian manifold, then the exponential map \(\exp _{x}: T_x \mathbb {P} \rightarrow \mathbb {P}\) at \(x \in \mathbb {P}\) is defined by
where \(\gamma _v(\cdot ,x)\) is the geodesic starting from x with velocity v (that is, \(\gamma _v(0,x)=x\) and \(\gamma _{v}^{\prime }(0,x)=v\)). Then, for any t, we have \(\exp _{x}tv=\gamma _v(t,x)\) and \(\exp _{x}{} \textbf{0}=\gamma _v(0,x)=x.\) Note that the mapping \(\exp _x\) is differentiable on \(T_x \mathbb {P}\) for every \(x \in \mathbb {P}.\) The exponential map \(\exp _{x}\) has an inverse \(\exp _{x}^{-1}: \mathbb {P} \rightarrow T_x \mathbb {P}.\) For any \(x,y \in \mathbb {P},\) we have \(d(x,y)=\Vert \exp _{y}^{-1}x\Vert =\Vert \exp _{x}^{-1}y\Vert \) (see [40] for more details). The parallel transport \(\Gamma _{\gamma ,\gamma (b),\gamma (a)}: T_{\gamma (a)}\mathbb {P} \rightarrow T_{\gamma (b)}\mathbb {P}\) on the tangent bundle \(T\mathbb {P}\) along \(\gamma :[a,b] \rightarrow \mathbb {R}\) with respect to \(\nabla \) is defined by
where F is the unique vector field such that \(\nabla _{\gamma ^{\prime }(t)}v=\textbf{0}\) for all \(t\in [a,b]\) and \(F(\gamma (a))=v.\) If \(\gamma \) is a minimizing geodesic joining x to y, then we write \(\Gamma _{y,x}\) instead of \(\Gamma _{\gamma ,y,x}.\) Note that for every \(a,b,r,s \in \mathbb {R},\) we have
Also, \(\Gamma _{\gamma (b),\gamma (a)}\) is an isometry from \(T_{\gamma (a)}\mathbb {P}\) to \(T_{\gamma (b)}\mathbb {P},\) that is, the parallel transport preserves the inner product
Below is an example of a Hadamard manifold.
Space 1: Let \(\mathbb {R}_{++}^{m}\) be the product space \(\mathbb {R}_{++}^m:= \{(x_1,x_2, \cdots , x_m): x_i \in \mathbb {R}_{++},~i=1,2, \cdots , m\}\). Let \(\mathbb {P} = (\mathbb {R}^m_{++}, \langle \cdot ,\cdot \rangle )\) be the m-dimensional Hadamard manifold with the Riemannian metric \(\langle p,q \rangle =p^\textrm{T} q\) and the distance \(d(x,y)=|\ln \frac{x}{y}|=|\ln \sum \limits _{i=1}^{m}\frac{x_i}{y_i}|,\) where \(x,y \in \mathbb {P}\) with \(x=\{x_i\}_{i=1}^{m}\) and \(y=\{y_i\}_{i=1}^{m}\).
A subset \(\mathcal {K} \subset \mathbb {P}\) is said to be convex if for any two points \(x,y \in \mathcal {K},\) the geodesic \(\gamma \) joining x to y is contained in \(\mathcal {K}.\) That is, if \(\gamma :[a,b] \rightarrow \mathbb {P}\) is a geodesic such that \(x=\gamma (a)\) and \(y=\gamma (b),\) then \(\gamma ((1-t)a+tb) \in \mathcal {K}\) for all \(t \in [0,1].\) A complete simply connected Riemannian manifold of non-positive sectional curvature is called a Hadamard manifold. We denote by \(\mathbb {P}\) a finite dimensional Hadamard manifold. Henceforth, unless otherwise stated, we represent by \(\mathcal {K}\) a nonempty, closed and convex subset of \(\mathbb {P}.\)
Next, let \(\mathcal {H(K)}\) denote the set of all single-valued vector fields \(U:\mathcal {K} \rightarrow T\mathbb {P}\) such that \(U(p) \in T_{p}\mathbb {P}\), for each \(p \in \mathcal {K}.\) Let \(\mathcal {X(K)}\) denote to the set of all multivalued vector fields \(V: \mathcal {K} \rightarrow 2^{T\mathbb {P}}\) such that \(V(p)\subseteq T_{p}\mathbb {P}\) for each \(p \in \mathcal {K},\) and the denote \(\textrm{Dom}(V)\) the domain of V defined by \(\textrm{Dom}(V)=\{p \in \mathcal {K}: V(p)\ne \varnothing \}.\)
We state some results and definitions which are needed in the next section.
Definition 1
[50] A vector field \(U \in \mathcal {H(K)}\) is said to be
-
(i)
monotone, if
$$\begin{aligned} \langle U(p), \exp _{p}^{-1}q\rangle \leqslant \langle U(q), -\exp _{q}^{-1}p\rangle ,~\forall ~p,q \in \mathcal {K}, \end{aligned}$$ -
(ii)
L-Lipschitz continuous if there exists \(L> 0\) such that
$$\begin{aligned} \Vert \Gamma _{p,q}U(q)-U(p)\Vert \leqslant Ld(p,q),~\forall ~p, q \in \mathcal {K}. \end{aligned}$$
Definition 2
[14] A vector field \(V \in \mathcal {X(K)}\) is said to be
-
(i)
monotone, if for all \(p, q \in \textrm{Dom}(V)\),
$$\begin{aligned} \langle u, \exp _{p}^{-1}q\rangle \leqslant \langle v, -\exp _{q}^{-1}p\rangle ,~\forall ~u \in V(p)~ \text {and}~\forall ~ v \in V(q), \end{aligned}$$ -
(ii)
maximal monotone if it is monotone and \(\forall ~p \in \mathcal {K}\) and \(u \in T_{p}\mathcal {K},\) the condition
$$\begin{aligned} \langle u, \exp _{p}^{-1}q\rangle \leqslant \langle v, -\exp _{q}^{-1}p\rangle ,~\forall ~q \in \textrm{Dom}(V)~\text {and}~ \forall ~v \in V(q)~\text {implies that}~u \in V(p). \end{aligned}$$
Definition 3
[17] Let \(\mathcal {K}\) be a nonempty, closed and subset of \(\mathbb {P}\) and \(\{x_n\}\) be a sequence in \(\mathbb {P}\). Then, \(\{x_n\}\) is said to be Fejèr convergent with respect to \(\mathcal {K}\) if for all \(p \in \mathcal {K}\) and \(n \in \mathbb {N},\)
Definition 4
[25] Let \(V \in \mathcal {X(K)}\) be a vector field and \(x_0 \in \mathcal {K}.\) Then, V is said to be upper Kuratowski semicontinuous at \(x_0\) if for any sequences \(\{x_n\} \subseteq \mathcal {K}\) and \(\{v_n\} \subset T\mathbb {P}\) with each \(v_n \in V(x_n),\) the relations \(\lim \limits _{n\rightarrow \infty } {v_n}=v_0\) imply that \(v_0 \in V(x_0)\). Moreover, V is said to be upper Kuratowski semicontinuous on \(\mathcal {K}\) if it is upper Kuratowski semicontinuous for each \(x \in \mathcal {K}.\)
Lemma 1
[17] Let \(\mathcal {K}\) be a nonempty, closed and closed subset of \(\mathbb {P}\) and \(\{x_n\} \subset \mathbb {P}\) be a sequence such that \(\{x_n\}\) be a Fejér convergent with respect to \(\mathcal {K}.\) Then, the following hold:
-
(i)
For every \(p \in \mathcal {K},~ d(x_n, p)\) converges.
-
(ii)
\(\{x_n\}\) is bounded.
-
(iii)
Assume that every cluster point of \(\{x_n\}\) belongs to \(\mathcal {K}\), then \(\{x_n\}\) converges to a point in \(\mathcal {K}\).
Proposition 1
[40]. Let \(x \in \mathbb {P}\). The exponential mapping \(\exp _{x}: T_x \mathbb {P} \rightarrow \mathbb {P}\) is a diffeomorphism. For any two points \(x,y \in \mathbb {P},\) there exists a unique normalized geodesic joining x to y, which is given by
A geodesic triangle \(\Delta (p,q,r)\) of a Riemannian manifold \(\mathbb {P}\) is a set containing three points p, q, r and three minimizing geodesics joining these points.
Proposition 2
[40]. Let \(\Delta (p,q,r)\) be a geodesic triangle in \(\mathbb {P}\). Then
and
Moreover, if \(\theta \) is the angle at p, then we have
Also,
Remark 1
[25] If \(x, y \in \mathbb {P}\) and \(v \in T_{y}\mathbb {P},\) then
Lemma 2
[21] Let \(\mathbb {P}\) be a Hadamard manifold and let \(u,v, w \in \mathbb {P}.\) Then,
Lemma 3
[25] Let \(x_0 \in \mathbb {P}\) and \(\{x_n\} \subset \mathbb {P}\) with \(x_n \rightarrow x_0.\) Then, the following assertions hold:
-
(i)
For any \(y \in \mathbb {P},\) we have \(\exp _{x_n}^{-1}y \rightarrow \exp _{x_0}^{-1}x_n\) and \(\exp _{y}^{-1}x_n \rightarrow \exp _{y}^{-1}x_0.\)
-
(ii)
If \(v_n \in T_{x_n}\mathbb {P}\) and \(v_n \rightarrow v_0,\) then \(v_0 \in T_{x_0}\mathbb {P}.\)
-
(iii)
Given \(u_n,v_n \in T_{x_n}\mathbb {P}\) and \(u_0, v_0 \in T_{x_0}\mathbb {P}\), if \(u_n \rightarrow u_0,\) then \(\langle u_n, v_n\rangle \rightarrow \langle u_0, v_0\rangle .\)
-
(iv)
For any \(u \in T_{x_0}\mathbb {P},\) the function \(F: \mathbb {P} \rightarrow T\mathbb {P},\) defined by \(F(x)=\Gamma _{x, x_0}u\) for each \(x \in \mathbb {P}\) is continuous on \(\mathbb {P}\).
The next lemma presents the relationship between triangles in \(\mathbb {R}^2\) and geodesic triangles in Riemannian manifolds (see [12]).
Lemma 4
[12]. Let \(\Delta (x_1,x_2,x_3)\) be a geodesic triangle in \(\mathbb {P}.\) Then, there exists a triangle \(\Delta (\bar{x}_1,\bar{x}_2,\bar{x}_3)\) corresponding to \(\Delta (x_1,x_2,x_3)\) such that \(d(x_i,x_{i+1})=\Vert \bar{x}_{i}-\bar{x}_{i+1}\Vert \) with the indices taken modulo 3. This triangle is unique up to isometries of \(\mathbb {R}^2.\)
The triangle \(\Delta (\bar{x}_1,\bar{x}_2,\bar{x}_3)\) in Lemma 4 is said to be the comparison triangle for \(\Delta (x_1,x_2,x_3) \subset \mathbb {P}.\) The points \(\bar{x}_1,\) \(\bar{x}_2\) and \(\bar{x}_3\) are called comparison points to the points \(x_1,x_2\) and \(x_3\) in \(\mathbb {P}.\)
A function \(h: \mathbb {P} \rightarrow \mathbb {R}\) is said to be geodesic if for any geodesic \(\gamma \in \mathbb {P},\) the composition \(h \circ \gamma : [u,v] \rightarrow \mathbb {R}\) is convex, that is,
Lemma 5
[25] Let \(\Delta (p,q,r)\) be a geodesic triangle in a Hadamard manifold \(\mathbb {P}\) and \(\Delta (p^{\prime }, q^{\prime }, r^{\prime })\) be its comparison triangle.
-
(i)
Let \(\alpha , \beta , \gamma \) (resp. \(\alpha ^{\prime }, \beta ^{\prime }, \gamma ^{\prime })\) be the angles of \(\Delta (p,q,r)\) (resp. \(\Delta (p^{\prime }, q^{\prime }, r^{\prime }))\) at the vertices p,q,r (resp. \(p^{\prime }, q^{\prime }, r^{\prime })\). Then, the following inequalities hold:
$$\begin{aligned} \alpha ^{\prime } \geqslant \alpha , ~\beta ^{\prime } \geqslant \beta ,~\gamma ^{\prime }\geqslant \gamma . \end{aligned}$$ -
(ii)
Let z be a point in the geodesic joining p to q and \(z^{\prime }\) its comparison point in the interval \([p^{\prime }, q^{\prime }].\) Suppose that \(d(z,p)=\Vert z^{\prime }-p^{\prime }\Vert \) and \(d(z^{\prime },q^{\prime })=\Vert z^{\prime }-q^{\prime }\Vert \). Then, the following inequality holds:
$$\begin{aligned} d(z,r)\leqslant \Vert z^{\prime }-r^{\prime }\Vert . \end{aligned}$$
Lemma 6
[25] Let \(x_0 \in \mathbb {P}\) and \(\{x_n\} \subset \mathbb {P}\) be such that \(x_n \rightarrow x_0.\) Then, for any \(y \in \mathbb {P},\) we have \(\exp _{x_n}^{-1}y \rightarrow \exp _{x_0}^{-1}y\) and \(\exp _{y}^{-1}x_n \rightarrow \exp _{y}^{-1}x_0.\)
The following propositions (see [17]) are very useful in our convergence analysis:
Proposition 3
Let \(\mathbb {P}\) be a Hadamard manifold and \(d: \mathbb {P} \times \mathbb {P}: \rightarrow \mathbb {R}\) be the distance function. Then the function d is convex with respect to the product Riemannian metric. In other words, given any pair of geodesics \(\gamma _1: [0,1] \rightarrow \mathbb {P}\) and \(\gamma _2: [0,1] \rightarrow \mathbb {P},\) then for all \(t \in [0,1],\) we have
In particular, for each \(y \in \mathbb {P},\) the function \(d(\cdot ,y): \mathbb {P} \rightarrow \mathbb {R}\) is a convex function.
Proposition 4
Let \(\mathbb {P}\) be a Hadamard manifold and \(x \in \mathbb {P}\). The map \(\Phi _x=d^2(x,y)\) satisfying the following:
-
(1)
\(\Phi _x\) is convex. Indeed, for any geodesic \(\gamma : [0,1] \rightarrow \mathbb {P}\), the following inequality holds for all \(t \in [0,1]:\)
$$\begin{aligned} d^2(x, \gamma (t)) \leqslant (1-t)d^2(x, \gamma (0)) + td^2(x, \gamma (1))-t(1-t)d^2(\gamma (0), \gamma (1)). \end{aligned}$$ -
(2)
\(\Phi _x\) is smooth. Moreover, \(\partial \Phi _x(y)=-2\exp _{y}^{-1}x.\)
Lemma 7
[18] Let \(\{v_n\}\) and \(\{\delta _n\}\) be nonnegative sequences which satisfy
Then,
Moreover, if \(\sum \limits _{n=1}^{\infty }\delta _n < + \infty ,\) then \(\{v_n\}\) is bounded.
Lemma 8
[34] Let \(\{a_n\}, \{\varphi _n\}\) and \(\{\beta _n\}\) be nonnegative sequences which satisfy
If \(\sum \limits _{n=1}^{\infty }\beta _n< + \infty \) and \(\sum \limits _{n=1}^{\infty }\varphi _n < + \infty ,\) then \(\lim \limits _{n \rightarrow \infty }a_n\) exists.
3 Main Result
In this section, we present an iterative method for solving variational inclusion problem in the settings of Hadamard manifolds. We state the following assumptions:
Assumption 1
-
(L1)
\(\Phi \in \mathcal {H(K)}\) is monotone and L-Lipschitz continuous, and \(\Psi \in \mathcal {X(K)}\) is maximal monotone.
-
(L2)
The solution set \(\Omega := (\Phi +\Psi )^{-1}(\textbf{0})\) is nonempty.
-
(L3)
\(\{\lambda _k\}\) is a nonnegative real numbers sequence such that \(\sum \limits _{k=1}^{\infty }\lambda _k< \infty .\)
![figure a](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs40305-024-00537-0/MediaObjects/40305_2024_537_Figa_HTML.png)
We start by establishing a technical lemma useful to our analysis.
Lemma 9
[2, 27] Let \(\{q_k\}\) be a sequence generated by Algorithm 19 and the sequence \(\{\rho _{k}\}\) is generated by (19). Then we have that \(\lim \limits _{k \rightarrow \infty }\rho _{k}=\rho \) and \(\rho \in \bigg [\min \big \{\frac{\mu }{L},~ \rho _{0}\big \}, \rho _{0}+ \lambda \bigg ],\) where \(\lambda =\sum \limits _{k=0}^{\infty }\lambda _k.\)
Remark 10
It is obvious that the stepsize in Algorithm 19 is allowed to increase from iteration to iteration and so (19) reduces the dependence on the initial stepsize \(\rho _{0}\). Also, since \(\{\lambda _k\}\) is summable, we obtain \(\lim \limits _{k \rightarrow \infty }\lambda _k=0.\) Thus the stepsize \(\lambda _{k}\) may be non-increasing when k is large. If \(\lambda _k \equiv 0,\) the step size in (19) reduces to the one in [20].
Theorem 1
Suppose that Assumptions (L1)-(L3) holds and let \(\{q_k\}\) be a sequence generated by Algorithm 19. If \(\sum \nolimits _{k=1}^{\infty }\alpha _k < +\infty \) and \(\sum \nolimits _{k=1}^{\infty }\theta _k < + \infty ,\) then
-
(i)
\(d(q_{k+1}, p) \leqslant M \cdot \prod \limits _{j=1}^{k}(1+ 2(\alpha _j + \theta _j(1+\alpha _j))),\) where \(M:=\max \{d(q_1, p), d(q_2, p)\}.\)
-
(ii)
The sequence \(\{q_k\}\) converges to an element in \(\Omega .\)
Proof
Let \(p \in \Omega ,\) then \(-\Phi (q) \in \Psi (p)\). Using (16) of Algorithm 19, we get \(\frac{1}{\rho _k}\exp _{t_k}^{-1}z_k-\Gamma _{t_k,z_k}\Phi (z_k) \in \Psi (t_k).\) By applying the monotonicity of \(\Psi \), we deduce that
Since \(\Phi \) is a monotone vector field, then
By combining (20) and (21), we have
thus
Now, for \(k \in \mathbb {N}.\) Let \(\Delta (z_k, t_k, p) \subseteq \mathbb {P}\) be a geodesic triangle with vertices \(z_k, t_k\) and p and let \(\Delta (z_k^{\prime }, t_k^{\prime }, p^{\prime })\subset \mathbb {R}^2\) be the corresponding comparison triangle, thus we have from Lemma 5 (ii) that \(d(z_k, p)=\Vert z_k^{\prime }-p^{\prime }\Vert ,~ d(t_k, p)=\Vert t_k^{\prime }-p^{\prime }\Vert \) and \(d(t_k^{\prime }, z_k^{\prime })=\Vert t_k^{\prime }-z_k^{\prime }\Vert \). Also, let \(\Delta (q_{k+1}, t_k, p) \subseteq \mathbb {P}\) be a geodesic triangle with vertices \(q_{k+1},~ t_k\) and p, then \(\Delta (q_{k+1}^{\prime }, t_k^{\prime }, p^{\prime }) \subseteq \mathbb {R}^2\) is the corresponding comparison triangle. Hence, we have \(d(q_{k+1}, p)=\Vert q_{k+1}^{\prime }-p^{\prime }\Vert , ~d(t_k, p)=\Vert t_k^{\prime }-p^{\prime }\Vert \) and \(d(q_{k+1}, t_k)=\Vert q_{k+1}^{\prime }-t_k^{\prime }\Vert .\)
Now,
Let r and \(r^{\prime }\) be the angles of the vertices \(t_k\) and \(t_k^{\prime }\), respectively. By Lemma 5 (i), we get \(r^{\prime } \geqslant r\). Therefore, we obtain from Lemma 4 and (13) that
Following the same argument as in (24), we have
Hence, we deduce from (18) that
On substituting (24), (25) and (26) into (23), we obtain
Using Remark 1, Lemma 2 and (27), we get
which also implies that
It follows from the definition of \(q_{k+1}\) that \(\exp _{t_k}^{-1}q_{k+1}=\rho _k(\Gamma _{t_k,z_k}\Phi (z_k)-\Phi (t_k)).\) Using the last inequality, we obtain that
By substituting (19) and (22) in (30), we get
By utilizing the geodesic triangles \(\bigtriangleup (w_k, q_k, p) \subset \mathbb {P}\) and \(\bigtriangleup (q_k, q_{k-1}, p) \subset \mathbb {P}\) with their respective comparison triangles \(\bigtriangleup (w_k^{\prime }, q_{k}^{\prime }, p^{\prime }) \subseteq \mathbb {R}^2\). Then, by Lemma 5 (ii), we have \(d(w_k, q_k)= \Vert w_k^{\prime }-q_k^{\prime }\Vert ,~ d(w_k, p)=\Vert w_k^{\prime }-p^{\prime }\Vert \) and \(d(q_{k}, q_{k-1})=\Vert q_{k}^{\prime }-q_{k-1}^{\prime }\Vert \). Similarly, using the geodesic triangles \(\bigtriangleup (z_k, w_k, p) \subset \mathbb {P}\) and \(\bigtriangleup (q_k, q_{k-1}, p) \subset \mathbb {P}\) with their respective comparison triangle \(\bigtriangleup (z_{k}^{\prime }, w_{k}^{\prime }, p^{\prime }) \subseteq \mathbb {R}^2\). Then, by Lemma 5 (ii), we have \(d(z_k, w_k)=\Vert z_k^{\prime }-w_{k}^{\prime }\Vert ,~ d(z_k, q_k)=\Vert z_{k}^{\prime }-q_{k}^{\prime }\Vert \) and \(d(z_k, p)=\Vert z_{k}^{\prime }-p^{\prime }\Vert \). From step 1 of Algorithm 19, we have that \(w_k^{\prime }=q_k^{\prime } + \alpha _k(q_{k}^{\prime }-q_{k-1}^{\prime })\) and \(z_{k}^{\prime }=w_{k}^{\prime } + \theta _k(w_{k}^{\prime }-q_{k-1}^{\prime })\), thus
Similarly, it is easy to see that
By definition of \(z_{k},\) (32) and (33), we get
Since \(\lim \limits _{k \rightarrow \infty }\big (1-\mu ^2\frac{\rho _k^{2}}{\rho _{k+1}^2}\big ) =1-\mu ^2 > 0,\) this implies that there exists \(N> 0\) such that \(1-\mu ^2 \frac{\rho _k^{2}}{\rho _{k+1}^2} > 0, \forall ~k \geqslant \mathbb {N}.\)
From (31) and (34), we deduce that
By applying Lemma 7, we obtain that
where \(M=\max \{d(q_1, p), d(q_2, p)\}\). Hence, the proof completes.
To establish the second part of the proof, we need to show that \(\{q_k\}\) converges to a point in \(\Omega .\) Since \(\sum \limits _{k=1}^{\infty }\alpha _k < + \infty \) and \(\sum \limits _{k=1}^{\infty }\theta _k < + \infty \), by Lemma 7 and (36), the sequence \(\{q_k\}\) is bounded. This also implies that \(\sum \limits _{k=1}^{\infty }\alpha _k d(q_{k},q_{k-1}) < + \infty \) and \(\sum \limits _{k=1}^{\infty }\theta _k d(q_{k},q_{k-1}) < + \infty .\) Using Lemma 8 in (35), we can claim that \(\lim \limits _{k \rightarrow \infty } d(q_{k}, p)\) exists. We have from Lemma 5 (ii) and Proposition 4 that
We also consider
But from (14), we have
On substituting (39) into (38), we get
We deduce from Lemma 5, (37) and (40) that
On substituting (41) into (31), we obtain
The last inequality yields
Since \(\lim \limits _{k \rightarrow \infty }d(q_{k}, p)\) exists, \(\sum \limits _{k=1}^{\infty }\alpha _k< + \infty \) and \(\sum \limits _{k=1}^{\infty }\theta _k < + \infty \). It follows from (43) that
Note that
From (45), we get
Using (45) and (46), we deduce that
Since \(\{q_k\}\) is bounded, there exists a subsequence \(\{q_{k_l}\}\) which converges to a cluster point \(\overline{p}\). Also, from (47), there exists a subsequence \(\{t_{k_l}\}\) of \(\{t_k\}\) which converges weakly to \(\overline{p} \in \mathbb {P}\). By (17), we deduce that
Thus, by applying (44), we have
hence,
Since \(\Phi \) is a Lipschitz continuous vector field and \(z_{k_{l}} \rightarrow \overline{p}\) as \(l \rightarrow \infty .\) Combining (49) and (50), we obtain
Also, using the fact that \(\Psi \) is a maximal monotone vector field, so it is upper Kuratowski semicontinuous. Thus \(-\Gamma (\overline{p}) \in \Psi (\overline{p}),\) which implies that \(\overline{p}\) solves \(\Omega \). Lastly by Lemma 1, we obtain that \(\{q_k\}\) converges to a point in \(\Omega .\)
4 Numerical Example
Example 1
Let \(\mathbb {R}_{++}=\{x \in \mathbb {R}: x > 0 \}\) and \(\mathbb {P}=(\mathbb {R}_{++}, \langle \cdot ,\cdot \rangle )\) be the Riemannian manifold with Riemannian metric defined by \(\langle p,q\rangle =\frac{1}{x^2}pq\; \in \mathbb {R}_{++}, \; p,q \in T_{x}\mathbb {P}.\) The Riemannian distance \(d: \mathbb {P} \times \mathbb {P} \rightarrow \mathbb {R}_{+}\) is given by \(d(x,y)=|\ln \frac{y}{x}|\) for all \(x,y \in \mathbb {P}.\) Let \(x \in \mathbb {P},\) then the exponential map \(\exp _{x}:T_x \mathbb {P} \rightarrow \mathbb {P}\) is defined by \(\exp _{x} sq=x\textrm{e}^{\frac{qs}{x}}\) for all \(q \in T_x \mathbb {P}.\) The inverse of the exponential map, \(\exp _{x}^{-1}: \mathbb {P} \rightarrow T_x \mathbb {P}\) is defined by \(\exp _{x}^{-1}y=x\ln \frac{y}{x}\) for all \(x,y \in \mathbb {P}.\) The parallel transport is the identity on \(T\mathbb {P}.\) Let \(\mathcal {K}=(0,1],\) \(\Psi :\mathcal {K} \rightarrow \mathbb {R}\) and \(\Phi : \mathcal {K} \rightarrow T\mathbb {P}\) be defined by \(\Psi (x)=x\ln x\) and \(\Phi (x)=x(1+\ln x)\), respectively. Then, \(\Psi \) is maximal monotone on \(\mathcal {K}\) and \(\Phi \) is a continuous and monotone vector field on \(\mathcal {K}.\) By simple calculation, we obtain that \(t_k\) in Algorithm 19 can be expressed as
and \((\Phi +\Psi )^{-1}(0)=\frac{1}{\sqrt{\textrm{e}}}.\) We choose \(\alpha _{k}=\frac{1}{k+1},\) \(\theta _k=\frac{1}{2n+3},\) \(\lambda _k=\frac{1}{k\sqrt{k}},\) \(\mu =\frac{1}{2}\) and \(\rho _{0}=0.3.\) We terminate the execution of the process at \(E_k=d(x_{k+1},x_k)=10^{-3}\) and make a comparison of Algorithm 19 with a step inertial and non-accelerated versions of the Algorithm. We test the convergence of the method with some initial values of \(x_0\) and \(x_1.\) The result of this experiment is shown in Fig. 1.
- Case I::
-
\(x_0=0.1\) and \(x_1=0.18.\)
- Case II::
-
\(x_0=0.9\) and \(x_1=0.5.\)
Numerical report for Example 2
Example 2
Let \(\mathbb {R}^{3}_{++}=\{x=(x_1,x_2,x_3) \in \mathbb {R}^3: x_i >0, i=1,2,3\},\) \(\mathbb {P}=(\mathbb {R}^{3}_{++},\langle \cdot ,\cdot \rangle ) \) be the Riemannian manifold with the Riemannian metric is defined by
where G(x) is a diagonal matrix defined \(G(x)=\textrm{diag}(x_{1}^{-2},x_{2}^{-2},x_{3}^{-2}).\) The Riemannian \(d: \mathbb {P} \times \mathbb {P} \rightarrow \mathbb {R}_{+}\) is defined by
The sectional curvature of the Riemannian manifold \(\mathbb {P}\) is 0. Thus \(\mathbb {P}=(\mathbb {R}_{++}^{3},\langle \cdot ,\cdot \rangle )\) is a Hadamard manifold. Let \(x=(x_1,x_2,x_3) \in \mathbb {P}.\) Then, the exponential map \(\exp _{x}: T_x \mathbb {P} \rightarrow \mathbb {P}\) is defined by
for all \(p=(p_1,p_p,p_3) \in T_x \mathbb {P}.\) The inverse of the exponential map, \(\exp _{x}^{-1}: \mathbb {P}\rightarrow T_x \mathbb {P}\) is defined by
for all \(x,y \in \mathbb {P}.\) The parallel transport \(\Gamma _{y,x}: T_x \mathbb {P} \rightarrow T_y \mathbb {P}\) is defined by
for all \(p=(p_1,p_2,p_3) \in T_x \mathbb {P}.\) Let \(\mathcal {K}=\{x=(x_1,x_2,x_3) \in \mathbb {P}: 0 < x_i \leqslant 1, ~~\text{ for }~~i=1,2,3 \}\) be the geodesic convex subset of \(\mathbb {P}.\) Let \(\Phi :\mathbb {M} \rightarrow T\mathbb {P}\) be defined by
and \(\Phi :\mathbb {M} \rightarrow T\mathbb {P}\) be defined by
Then, \(\Psi \) is maximal monotone vector field on \(\mathcal {K}\) and \(\Phi \) is continuous and monotone vector field on \(\mathcal {K}\) (see [8, Example 1]). By simple calculation, we see that \(t_k\) in Algorithm 19 can be expressed as
Note that \((\Psi +\Phi )^{-1}(0)=\{(1,\frac{1}{\textrm{e}},\frac{1}{2})\}.\) Let \(\alpha _{k}=\frac{1}{k+1},\) \(\theta =\frac{1}{2k+3},\) \(\lambda _k=\frac{1}{k\sqrt{k}},\) \(\mu =\frac{1}{2}\) and \(\rho _0=0.9.\) We terminate the execution of the process at \(E_k=d(x_{k+1},x_k)=10^{-4}\) and make a comparison of Algorithm 19 with one inertial and a non-accelerated versions of the Algorithm. The result of this experiment is shown in Fig. 2 for two initial values of \(x_0\) and \(x_1.\)
- Case 1::
-
\(x_0=[1.5,1.5,1.5]'\) and \(x_1=[1.3,1.2,1.1]'.\)
- Case 2::
-
\(x_0=[1.8,1.8,1.8]'\) and \(x_1=[1.5,1.5,1.6]'.\)
Numerical report for Example 2
5 Conclusion
In this manuscript, we proposed double inertial methods with a forward–backward method for solving variational inclusion problem in the settings of a Hadamard manifold. We establish a convergence result for solving variational inclusion problem and illustrate some numerical examples to show the performance of our method in comparison with some related ones in the literature. It can be seen from our figures that the two steps inertial extrapolation method illustrated in our manuscript converges faster that the one step inertial method and the non-inertial iterative method. This result discussed in this manuscript is new in the settings of a Hadamard manifold.
Data Availability
No data were used for the research described in the article.
References
Abass, H.A., Izuchukwu, C., Mewomo, O.T., Dong, Q.L.: Strong convergence of an inertial forward-backward splitting method for accretive operators in real Banach spaces. Fixed Point Theory 21(2), 397–412 (2020)
Abass, H.A., Oyewole, O.K., Jolaoso, L.O., Aremu, K.O.: Modified inertial Tseng method for solving variational inclusion and fixed point problems on Hadamard manifolds. Appl. Anal. (2023). https://doi.org/10.1080/00036811.2023.2256357
Abass, H.A., Oyewole, O.K., Onifade, O.M., Narain, O.K.: Iterative approximation of common solution of variational inequality and certain optimization problems with multiple output sets in Hadamard space. Analysis (2024). https://doi.org/10.1515/anly-2022-1075
Alvarez, F.: On the minimizing property of a second order dissipative system in Hilbert spaces. SIAM J. Control Optim. 38(4), 1102–1119 (2000)
Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9, 3–11 (2001)
Antipin, A.S.: Minimization of convex functions on convex sets by means of differential equations. Diff. Equ. 30(9), 1365–1375 (1994)
Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov’s accelerated forward-backward method os actually faster than \(\frac{1}{k^2}\). SIAM J. Optim. 26, 1824–1834 (2016)
Sahu, D.R., Babu, F., Sharma, S.: A new self-adaptive iterative method for variational inclusion problems on Hadamard manifolds with applications. Numer Algor 94, 1435–1460 (2023)
Baćak, M.: Old and new challenges in Hadamard spaces. arXiv:1807.01355v2 (2018)
Baćak, M.: Computing medians and means in Hadamard spaces. SIAM J. Optim. 24, 1542–1566 (2014)
Baćak, M.: The proximal point algorithm in metric spaces. Israel. J. Math. 194, 689–701 (2013)
Bridson, M.R., Haefliger, A.: Metric Spaces of Non-positive Curvature. Grundlehren der Mathematischen Wissenschaften (Fundamental Principles of Mathematical Sciences), vol. 319. Springer, Berlin (1999)
Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4, 1168–1200 (2005)
Cruz, J.X., Ferreira, O.P., Pérez, L.R., et al.: Monotone point-to-set vector fields. Balkan J. Geom. Appl. 5(1), 69–79 (2000)
Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraints. Commun. Pure Appl. Math. 57, 1413–1457 (2004)
Dong, Q.L., Cho, Y.J., Rassias, T.M.: General inertial Mann algorithms and their convergence analysis for nonexpansive mappings. Appl. Nonlinear Anal., pp. 175-191 (2018)
Ferreira, O.P., Oliveira, P.R.: Proximal point algorithm on Riemannian manifolds. Optimization 51(2), 257–270 (2002)
Hanjing, A., Suantai, S.: A fast image restoration algorithm based on a fixed point and optimization method. Mathematics 8(3), 378 (2020)
Jabeen, S., Noor, M.A., Noor, K.I.: Inertial methods for solving system of quasi variational inequalities. J. Adv. Math. Stud. 15(1), 1–10 (2022)
Khammahawong, K., Kumam, P., Chaipunya, P., Martinez, J.M.: Tseng’s method for inclusion problems on Hadamard manifolds. Optimization 71(15), 4367–4401 (2022)
Khammahawong, K., Chaipunya, P., Kumam, P.: An inertial Mann algorithm for nonexpansive for nonexpansive mappings on Hadamard manifolds. AIMS Math. 8(1), 2093–2116 (2023)
Li, C., López, G., Màrquez, V.M.: Resolvent of set-valued monotone vector fields in Hadamard manifolds. J. Set-Valued Anal. 19, 361–383 (2011)
Li, C., López, G., Martín-Márquez, V.: Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwan. J. Math 14, 541–559 (2010)
Li, X., Dong, Q.L., Gibali, A.: PMICA, Parallel multi-step inertial contracting algorithm for solving common variational inclusion. J. Nonlinear Funct. Anal. 2022, 7 (2022)
Li, C., López, G., Martín-Márquez, V.: Monotone vector fields and the proximal point algorithm on hadamard manifolds. J. Lond. Math. Soc. 79(3), 663–683 (2009)
Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964–979 (1979)
Liu, H., Yang, J.: Weak convergence of iterative methods for solving quasimonotone variational inequalities. Comp. Optim. Appl. 77, 491–508 (2020)
López, G., Martin-Marquez, V., Wang, F., Xu, H.K.: Forward-backward splitting methods for accretive operators in Banach spaces. Abstr. Appl. Anal., Article ID 109236 (2102)
Lorenz, D., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51, 311–325 (2015)
Liang, J.: Convergence rates of first-order operator splitting methods. PhD thesis, Normandie Universite, GREYC CNRS UMR 6072 (2016)
Mebawondu, A.A., Abass, H.A., Oyewole, O.K., Narain, O.K.: Generalized split null point of sum of monotone operators in Hilbert spaces. Demonstr. Math. 54(1), 359–376 (2021)
Moudafi, A., Oliny, M.: Convergence of a splitting inertial proximal method for monotone operators. J. Comput. Appl. Math. 155, 447–454 (2003)
Nestrov, Y.: A method for solving the convex programming problem with convergence rate \(O(\frac{1}{k^2})\). Dokl. Akad. Nauk SSSR 269, 543–547 (1983)
Osilike, M.O., Aniagbosor, S.C.: Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings. Math. Comput. Model. 32(10), 1181–1191 (2000)
Oyewole, O.K., Reich, S.: An inertial subgradient extragradient method for approximating solution to equilibrium problems in Hadamard manifold. Axioms 12(3), 256 (2023)
Oyewole, O.K., Abass, H.A., Mebawondu, A.A., Aremu, K.O.: A Tseng extragradient method for solving variational variational inequality problems in Banach spaces. Numer. Algorithms 89(2), 769–789 (2022)
Polyak, B.T.: Introduction to Optimization. Optimization Software, Publications Division, New York (1987)
Polyak, B.T.: Some methods of speeding up the convergence of iterative methods. Zh Vychisl. Mat. Mat. Fiz. 4, 1–17 (1964)
Poon, C., Liang, J.: Geometry of first-order methods and adaptive acceleration. arxiv: 2003.03910 (2020)
Sakai, T.: Riemannian geometry. Translations of mathematical monographs, Vol. 149, Providence (RI): American Mathematical Society (1996)
Shehu, Y.: Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results Math. 74, 138 (2018)
Shehu, Y., Yao, J.C.: Rate of convergence for inertial iterative method for countable family of certain quasi-nonexpansive mappings. J. Nonlinear Convex Anal. 21, 533–541 (2020)
Shehu, Y., Ezeora, J.N.: Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem. J. Nonlinear Var. Anal. 5, 881–892 (2021)
Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)
Suantai, S., Inkrong, P., Cholamjiak, P.: Forward-backward-forward algorithms involving two inertial terms for monotone inclusions. Comput. Appl. Math. 42, 255 (2023)
Thong, D.V., Cholamjiak, P.: Strong convergence of a forward-backward splitting method with a new step size for solving monotone inclusions. Comput. Appl. Math. 38, 94 (2019)
Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58, 267–288 (1996)
Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38, 431–446 (2009)
Ugwunnadi, G.C., Abass, H.A., Aphane, M., Oyewole, O.K.: Inertial Halpern-typemethod for solving split feasibility and fixed point problems via dynamical stepsize in real Banach spaces. Annali dell‘Universita di Ferrara (2023). https://doi.org/10.1007/s11565-023-00473-6
Wang, J.H., López, G., Martín-Márquez, V., Li, C.: Monotone and accretive vector fields on Riemannian manifolds. J. Optim Theory Appl. 146, 691–708 (2010)
Yao, Y., Iyiola, O.S., Shehu, Y.: Subgradient extragradient method with double inertial steps for variational inequalities. J. Sci. Comput. 90(2), 71 (2022)
Zhao, X., Yao, J.C., Yao, Y.: A proximal algorithm for solving split monotone variational inclusions. U.P.B. Sci. Bull. Ser. A 82(3), 43–52 (2020)
Funding
Open access funding provided by Sefako Makgatho Health Sciences University.
Author information
Authors and Affiliations
Contributions
H. A. Abass contributed to the conceptualization; H. A. Abass and O. K. Oyewole were involved in the methodology; O. K. Oyewole contributed to the software; H. A. Abass, L. O. Jolaoso and K. O. Aremu assisted in the validation; K. O. Aremu and L. O. Jolaoso performed the formal analysis; H. A. Abass contributed to writing–original draft preparation; all authors contributed to writing–review and editing and supervision; H. A. Abass contributed to the project administration. All authors have contributed equally to the completion of this manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that there is no competing interest.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Abass, H.A., Oyewole, O.K., Aremu, K.O. et al. Self-adaptive Technique with Double Inertial Steps for Inclusion Problem on Hadamard Manifolds. J. Oper. Res. Soc. China (2024). https://doi.org/10.1007/s40305-024-00537-0
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40305-024-00537-0
Keywords
- Variational inclusion problem
- Double inertial method
- Hadamard manifold
- Monotone operator
- Riemannian manifold