Search

The aim of this paper is to introduce a forward-backward-forward algorithm with inertial extrapolation to solve the problem of finding a common solution to the variational inequality problem (CSVIP) in a Hadamard manifold. Using a self-adaptive step size, we obtain convergence results under some standard conditions. Numerical examples are given to illustrate the theoretical analysis. Our result is a generalization and extension of previously announced results in this direction in the literature. [ABSTRACT FROM AUTHOR]

This paper introduces a schematic approximation method for a solution to a variational inequality problem in the framework of Hadamard manifold. The method is a combination of the subgradient extragradient technique and Popov extragradient method. Using this method, some convergence algorithms were proved when the cost operators are pseudomonotone and strongly pseudomonotone, respectively. In the construction of this method, the dependence on Lipschitz constants of the operators is dispensed with by the use of a monotone decreasing step size. We give an application of our main result to the constrained convex minimization problem. Finally, we report some numerical examples to illustrate the efficiency and applicability of the method. [ABSTRACT FROM AUTHOR]

In this paper, we consider a variational inequality problem which is defined over the intersection of the set of common fixed points of a finite family of generalized demimetric mappings and the set of common zero points of a finite family of maximal monotone mappings. We propose an iterative algorithm which combines the hybrid steepest descent method with the inertial technique to solve this variational inequality problem. Strong convergence theorem of the proposed method is established under standard and mild conditions. Moreover, we do not require any prior information regarding the Lipschitz and strongly monotone constants of the mapping. The results of this paper improve and extend several known results in the literature. [ABSTRACT FROM AUTHOR]

This paper studies modified extragradient methods with inertial extrapolation step and self-adaptive step-sizes for solving equilibrium problems in real Hilbert spaces. Strong convergence results are obtained under the assumption that the bifunction is pseudomonotone and satisfies the Lipchitz-type condition. Our method of proof is of independent interest and different from the recent arguments used in related papers on strong convergence methods with inertial steps for equilibrium problems. Numerical implementations and comparisons are given to support the theoretical findings. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a new cyclic iterative algorithm for finding a solution to the system of split equality zero-point problems in Hilbert spaces. The strong convergence of the proposed algorithm is established under some mild conditions. Moreover, this algorithm does not depend on the norm of the transfer mappings. Some applications of the main theorem to the related problems are also presented. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the split common fixed point problem with multiple output sets and develop novel approaches for effectively approximating its solution. We establish two convergence theorems under appropriate conditions for strictly pseudo-contractive mappings and demicontractive mappings, respectively, which cover some existing results as a special case. Furthermore, the numerical experiments demonstrate that we have developed a competitive method for solving the split common fixed point problem with multiple output sets. [ABSTRACT FROM AUTHOR]

In this paper, it is our purpose to introduce an inertial-like algorithm for approximating common fixed points of continuous pseudocontractive mappings in the framework of real Hilbert spaces. We prove strong convergence theorems for the sequence generated by the algorithm under certain conditions on the control sequences. We also provide numerical examples to demonstrate the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

In this paper, using a new shrinking projection method, we study the strong convergence theorem for finding a common point of the set of common fixed points of a finite family of Bregman demigeneralized mappings, common zero points of a finite family of Bregman inverse strongly monotone mappings and zero points of maximal monotone mapping in reflexive Banach space. Using this result, we get a new strong convergence theorem in Banach space. Our result extends and improves important recent results presented by many authors. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new relaxed inertial Tseng extragradient method with self-adaptive step size for approximating common solutions of monotone variational inequality and fixed point problems of quasi-pseudo-contraction mappings in real Hilbert spaces. We prove a strong convergence result for the proposed algorithm without the knowledge of the Lipschitz constant of the cost operator. Moreover, we apply our results to approximate solution of convex minimization problem, and we present some numerical experiments to show the efficiency and applicability of our method in comparison with some existing methods in the literature. Our proposed method is easy to implement. It requires only one projection onto a constructible half-space. [ABSTRACT FROM AUTHOR]

In this paper, we introduce two modified Tseng's extragradient algorithms with a new generalized adaptive stepsize for solving monotone variational inequalities (VI) in reflexive Banach spaces. The advantage of our methods is that stepsizes do not require prior knowledge of the Lipschitz constant of the cost mapping. Based on Bregman projection-type methods, we prove weak and strong convergence of the proposed algorithms to a solution of VI. Some numerical experiments to show the efficiency of our methods including a comparison with related methods are provided. [ABSTRACT FROM AUTHOR]

In this paper, we propose three kinds of inertial approximation methods based on the proximal gradient algorithm to accelerate the convergence of the algorithm for solving convex bilevel optimization problems. Under reasonable parameters, we prove that our algorithms converge strongly to some solution of the problem, which is the unique solution of a variational inequality problem. Firstly, two alternated inertial methods are presented. Secondly, a multi-step inertial method is proposed to accelerate the convergence of the algorithm. Thirdly, an alternated multi-step inertial method is further introduced. In addition, we also consider that the inertial parameters can be chosen as positive or negative parameters, and we get better results. Our numerical results illustrate the performances of our algorithms and present some comparisons with related algorithms. Our results improve and extend the corresponding results reported by some authors recently. [ABSTRACT FROM AUTHOR]

In this paper, we are concerned with the investigation problem of finding a common element of the set of fixed points of a total uniformly L-Lipschitzian mapping and the set of solutions of a system of generalized nonlinear variational-like inequalities. For this end, based on P-η-proximal mapping, an iterative algorithm is constructed and under some suitable conditions, the strong convergence and stability of the sequence generated by our proposed iterative algorithm to a common element of the above two sets are proved. [ABSTRACT FROM AUTHOR]

In this paper, we investigate and analyse the strong convergence of the sequence generated by an inexact proximal point method with possible unbounded errors for finding zeros of monotone operators in Hadamard spaces. We show that the boundedness of the generated sequence is equivalent to the zero set of the operator to be nonempty. In this case, we prove the strong convergence of the generated sequence to a zero of the operator. We also provide some applications of our main results and give a numerical example to show the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper we introduce a new projection-type algorithm in a reflexive Banach space. Then, using generalized resolvents operators and generalized projections, we prove a strong convergence theorem for computing a common element of the set of fixed points of a Bregman relatively nonexpansive mapping, solutions of an equilibrium problem, fixed points of a resolvent operator and fixed points of an infinite family of Bregman W-mappings. [ABSTRACT FROM AUTHOR]

This paper considers the problem of finding the resolvent of the sum of two maximal monotone operators. Such a problem arises frequently in practice, but it seems that computation of the solution of the problem is not necessarily easy. It is assumed that both the resolvents of two maximal monotone operators can be easily computed. This enables us to consider the case in which a solution to the problem cannot be computed easily. This paper introduces a new mapping, which satisfies the nonexpansivity property, from the individual resolvents of two maximal monotone operators and investigates some of its properties. In particular, we show that the mapping has a fixed point if and only if the problem has a solution. Then, using this mapping, we propose a splitting method for solving the problem in a real Hilbert space. In particular, we show that the sequences generated by the method converge strongly to the solution to the problem under certain assumptions. Convergence rate analysis of the methods is also provided to illustrate the method's efficiency. Finally, we apply the results to a class of optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, by employing a Bregman distance approach, we introduce a self-adaptive inertial extragradient method for finding a common solution of variational inequality problem involving a pseudo-monotone operator and fixed point problem of a Bregman demigeneralized mapping in a reflexive Banach spaces. Using a Bregman distance approach, we establish a strong convergence result for approximating the common solution of the aforementioned problems under some mild assumptions. We display some numerical examples to show the performance of our iterative method. The result presented in this paper extends and complements many related results in literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the so-called generalized monotone quasi-inclusion problem which is a generalization and extension of well-known monotone quasi-inclusion problem. We propose a forward–backward splitting method for solving this problem in the framework of reflexive Banach spaces. Based on Bregman distance function, we prove a strong convergence result of the proposed algorithm to a common zero of the problem. As an application, we apply the main result to the variational inequality problem. Finally, we provide some numerical examples to demonstrate our algorithm performance. The results presented in this paper improve and extend many known results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature. [ABSTRACT FROM AUTHOR]

In this paper, firstly, we study the continuity of Cauchy-type integral operator C Γ infra associated with inframonogenic functions and give the Plemelj formula. Secondly, we prove the properties of the Teodorescu operator related to the inframonogenic functions, including its boundness, continuity and differentiability. Finally, we give the related integral representation of Riemann boundary value problems for inframonogenic functions and generalized inframonogenic functions. [ABSTRACT FROM AUTHOR]

This paper proposes a new self-adaptive algorithm for solving the multiple-set split variational inequality problem in Hilbert spaces. Our algorithm uses dynamic step-sizes, chosen based on information of the previous step. In comparison with the work by Censor et al. [Numer Algorithms. 2012;59:301–323], the new algorithm gives strong convergence results and does not require information about the transformation operator's norm. Some applications of our main results regarding the solution of the multiple-set split feasibility problem and the split feasibility problem are presented and show that the iterative method converges strongly under weaker assumptions than the ones used recently by Xu [Inverse Probl. 2006;22:2021–2034] and by Buong [Numer Algorithms. 2017;76:783–798]. Numerical experiments on finite-dimensional and infinite-dimensional spaces and an application to discrete optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results. [ABSTRACT FROM AUTHOR]

In this paper, we construct a Halpern-type subgradient extragradient iterative algorithm which converges strongly to a common point of the f-fixed point set of a continuous f-pseudocontractive mapping and the solutions set of a variational inequality problem for Lipschitz monotone mapping in reflexive real Banach spaces. In addition, a numerical example is given to demonstrate the behaviour of the convergence of the algorithm. Our results improve, generalize and unify some related recent results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we propose and study new inertial viscosity Tseng's extragradient algorithms with self-adaptive step size to solve the variational inequality problem (VIP) and the fixed point problem (FPP) in Hilbert spaces. Our proposed methods involve a projection onto a half-space and self-adaptive step size. We prove that the sequence generated by our proposed methods converges strongly to a common solution of the VIP and FPP of an infinite family of strict pseudo-contractive mappings in Hilbert spaces under some mild assumptions when the underlying operator is monotone and Lipschitz continuous. Furthermore, we apply our results to find a common solution of VIP and zero-point problem (ZPP) for an infinite family of maximal monotone operators. Finally, we provide some numerical experiments of the proposed methods in comparison with other existing methods in the literature. [ABSTRACT FROM AUTHOR]

In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and q-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new inertial self-adaptive parallel subgradient extragradient method for finding common solution of variational inequality problems with monotone and Lipschitz continuous operators. The stepsize of the algorithm is updated self-adaptively at each iteration and does not involve a line search technique nor a prior estimate of the Lipschitz constants of the cost operators. Also, the algorithm does not required finding the farthest element of the finite sequences from the current iterate which has been used in many previous methods. We prove a strong convergence result and provide some applications of our result to other optimization problems. We also give some numerical experiments to illustrate the performance of the algorithm by comparing with some other related methods in the literature. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to construct a new iterative algorithm using the notion of P-η-resolvent operator for solving a new system of generalized multi-valued variational-like inclusions in the setting of Banach spaces. As an application of the constructed algorithm, the strong convergence of the sequences generated by our proposed iterative algorithm to a solution of the system of generalized multi-valued variational-like inclusions is proved. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new and efficient algorithm for finding a common element of the set of common fixed points of a finite family of generalized demimetric mappings and the set of common zero points of a finite family of inverse strongly monotone mappings in Hilbert spaces. Strong convergence of the proposed algorithm is established under standard and mild conditions in a Hilbert space. As an application, we use our algorithm for solving the common solutions to the variational inequality problem, the common minimization problem, the multiple-set split feasibility problem, the split common fixed point problem and the split common null point problem. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a self-adaptive Bregman subgradient extragradient method for solving variational inequalities in the framework of a reflexive Banach space. The step-adaptive strategy avoids the difficult task of choosing a stepsize based on the Lipschitz constant of the cost function of the variational inequalities and improves the performance of the algorithm. Moreover, the use of the Bregman distance technique allows the consideration of a general feasible set for the problem. Under some suitable conditions, we prove some weak and strong convergence results for the sequence generated by the algorithm without prior knowledge of the Lipschitz constant. We further provide an application to contact problems and some numerical experiments to illustrate the performance of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we are concerned with the problem of finding fixed points of nonexpansive mappings on Hadamard manifolds. To solving this kind of problem, a modified Riemannian Halpern algorithm, which is a natural generalization of a modified Halpern algorithm in Euclidean space is proposed. By giving some mild assumptions and necessary lemmas, the global convergence of the proposed algorithm is established. Finally, when the problem is solved in the framework of Hadamard manifolds, the numerical experiments show the effectiveness of the proposed algorithm, especially in computational time and number of iterations. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present a potential generalizations of celebrated theorems due to Kannan, Reich, Bianchini and Chatterjee in the set-up of an A-metric space. We unify these well-known fixed point theorems in A-metric space and give the simple proof of the result presented herein. For this purpose, we use concept of asymptotic regularity. Also, we give most general form of Kannan, Reich, Bianchini and Chatterjee Fixed Point Theorems in A-metric spaces, and prove these fixed point theorems using asymptotically regular sequences and maps rather than Picard iteration, respectively. Furthermore, we give some examples in support of our results. [ABSTRACT FROM AUTHOR]

In this paper, firstly, we extend the nonlinear Lebesgue spaces from the setting of Hadamard spaces to the setting of p-uniformly convex metric spaces. Afterward, we establish some Δ-convergence and strong convergence theorems for a recently introduced class of generalized nonexpansive mappings in the setting of p-uniformly convex metric spaces. Furthermore, we employ the newly introduced JK-iteration process to approximate the fixed points of this class. Finally, we construct new examples of this class of mappings in the context of p-uniformly convex metric spaces. [ABSTRACT FROM AUTHOR]

In this paper, we compute quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration in W-hyperbolic spaces. This iteration is an extension to a nonlinear setting of the modified Mann iteration defined recently by Boţ, Csetnek and Meier in Hilbert spaces. Furthermore, we show that the Douglas–Rachford and forward-backward algorithms with Tikhonov regularization terms are special cases, in Hilbert spaces, of our Tikhonov–Mann iteration. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to study a new viscosity iterative algorithm for finding a common element of the set of fixed points of an asymptotically nonexpansive mapping and the set of solutions of a new variational inequality problem involving inverse-strongly monotone operators in Hilbert spaces. We prove some strong convergence theorems under some suitable assumptions imposed on the parameters by using a modified extragradient method. The results obtained in this paper may be an improvement of many recent ones in this fields. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new viscosity iterative method for solving the split null point and common fixed point problems for maximal monotone operators and multivalued demicontractive mappings in Hilbert spaces, and we obtain some strong convergence results under some suitable assumptions. As applications, we apply our results to the split feasibility problem and the split minimization problem. The results obtained in this paper generalize and improve the recent ones announced by many authors. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new iterative algorithm from primal-dual methods for solving the split equality common fixed-point problem of quasi-nonexpansive mappings in real Hilbert space. Our algorithm includes the simultaneous iterative algorithm as special case which has been proposed by Moudafi and Al-Shemas for solving the split equality common fixed-point problem. We use a way of selecting the stepsizes such that the implementation of our algorithm does not need any prior information about bounded linear operator norms. It avoids the difficult task of estimating the operator norms. Under suitable conditions, we get the weak convergence of the proposed algorithm. The performance of the proposed algorithm is also illustrated by preliminary numerical experiments. The results presented in the paper improve and extend some corresponding results. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of ϕ-strongly pseudomonotone bifunctions in Banach spaces and present two simple subgradient-type methods for solving ϕ-strongly pseudomonotone equilibrium problem. Under mild and standard assumptions, strong convergence theorems of the proposed algorithms are established. To illustrate the usability of our results, a numerical example is given in a non-Hilbertian space. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study quasi-monotone variational inequality problems in infinite dimensional Hilbert spaces and to prove that the iterative sequence generated by an extragradient algorithm converges weakly to a solution. [ABSTRACT FROM AUTHOR]

In this paper, we propose a single projection method for finding a solution of the bilevel pseudo-monotone variational inequality problem in real Hilbert spaces. The advantage of the proposed algorithm requires only one projection onto the feasible set. Also, we prove strong convergence theorems of the proposed method under mild conditions, which improve some related results in the literature. Finally, we present some numerical experiments to show the efficiency and advantages of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to study the method of approximation for zeros of the sum of a finite family of maximal monotone mappings in the setting of Banach spaces. Under some mild conditions, we establish strong convergence results of the proposed approximation method. The assumptions that one of the mappings is single valued and α-inverse strongly monotone are dispensed with. In addition, we give some applications to the minimization problems. Finally, we provide a numerical example which supports our main result. Our theorems improve and unify most of the results that have been proved for this important class of nonlinear mappings. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of ϕ -nonexpansive sequences and maps in a Banach space E, and prove an ergodic theorem, a fixed point theorem, and some weak and strong convergence theorems for such sequences and maps in E, with rather mild assumptions on the Banach space E, weaker than those assumed by previous authors for nonexpansive maps. These results give a partial answer to the still open problem raised in 1981 by Djafari Rouhani for nonexpansive sequences in a Banach space. [ABSTRACT FROM AUTHOR]

In this paper, we define a quadrilateral inequality, Browder type and implicit iterative method in a CAT(1) space. Furthermore, we prove a convergence theorem of the implicit iterative method in the same space used the quadrilateral inequality. [ABSTRACT FROM AUTHOR]

In the current paper, we discuss sufficient and necessary conditions for the existence of best proximity points for cyclic f- contractive mappings in the setting of strictly convex Banach spaces. Extensions of Edelstein's theorem are considered as well as an extension of a main result in Park [Park, S. (1978). Fixed points of f-contractive maps. Rocky Mountain J. Math. 8:743–750]. Another existence result of best proximity points will be obtained for asymptotically relatively nonexpansive mappings under different conditions with respect to the recent paper of Rajesh and Veeramani [Rajesh, S., Veeramani, P. (2016). Best Proximity point theorems for asymptotically relatively nonexpansive mappings. Numer. Funct. Anal. Optim. 37:80–91]. [ABSTRACT FROM AUTHOR]

In this paper, we introduce new type iterative scheme called a 'modified Picard-S hybrid' iterative algorithm to establish Δ-convergence and strong convergence theorems under suitable conditions for total asymptotically nonexpansive mappings in CAT(0) spaces. Our results in the paper improve and extend many results appeared in the literature. Moreover, we also illustrate numerical examples for the proposed iteration process to compare speed of convergence among the existing iterative algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we establish an approximate fixed point theorem for Γ-τ-sequentially continuous countably Φ τ -condensing mappings. As application, we obtain an approximate fixed point result for demicontinuous mappings and use this to prove new results in asymptotic fixed point theory. Moreover, we obtain new fixed point results for some countably Φ τ -condensing mappings and multivalued mappings and fixed point results of Krasnoselskii-Daher type for the sum of two τ-sequentially continuous mappings in non-separable Hausdorff topological vector spaces. We also present a multivalued version of an approximation result of Ky Fan for τ-Γ-s.l.sc multivalued mappings. Apart from that, we show the applicability of our results to the theory of Volterra integral equations in Banach spaces and we prove the existence of limiting-weak solutions for differential equations in Banach spaces not necessarily reflexive. Our results extend the results of Banaś and Ben Amar, Barroso and Seda. [ABSTRACT FROM AUTHOR]

In this paper, a solution to the inclusion problem for an infinite family of monotone operators in Hadamard spaces is approximated. Strong convergence and Δ-convergence to a common zero of an infinite family of monotone operators are established. To support these results, some applications in convex optimization and fixed point theory are also presented. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new inertial extrapolation method for solving the generalized split feasibility problems over the solution set of monotone variational inclusion problems in real Hilbert spaces. We prove that the proposed method converges strongly to a solution to the aforementioned problem under the assumption that the associated singlevalued operator for the monotone variational inclusion problem is monotone and Lipschitz continuous. Our method uses a stepsize that is generated at each iteration by some simple computations, which allows it to be easily implemented without the prior knowledge of the Lipschitz constant of the singlevalued operator. Moreover, we discuss some consequences of our results and apply them to solve the split linear inverse problems, for which we also considered a special case of the split linear inverse problem, namely, the LASSO problem. We also give some numerical illustrations of the proposed method in comparison with other method in the literature to further demonstrate the applicability and efficiency of our method. [ABSTRACT FROM AUTHOR]

In this paper we consider a complete metric space of cyclical nonexpansive mappings acting on a union of two sets in a complete hyperbolic space with an empty intersection. Using Baire category approach, we show for most mappings the distance between iterates converges to the distance between these two sets. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce and analyze two inertial algorithms with self-adaptive stepsizes for solving variational inequalities in reflexive Banach spaces. Our algorithms are based on inertial hybrid and shrinking projection methods. Knowledge of the Lipschitz constant of the cost operator is not required. Under appropriate conditions, the strong convergence of the algorithms is established. We also present several numerical experiments which bring out the efficiency and the advantages of the proposed algorithms. Our work provides extensions of many known results from Hilbert spaces to reflexive Banach spaces. [ABSTRACT FROM AUTHOR]

A large number of nonlinear and optimization problems can be reduced to altering point problems. This paper aims to introduce the parallel normal S-iteration technique and study its convergence rates for solving such problems in infinite-dimensional Hilbert spaces under practical assumptions. We place particular emphasis on the parallel splitting method for the sum of two maximal monotone operators and that can apply for solving a class of convex composite minimization problems. Moreover, we present applications of our iterative methods to some nonlinear problems, such as a system of variational inequalities and a system of inclusion problems. Finally, to demonstrate the applicability of the altering point technique, the performances of our proposed parallel normal S-iteration methods are presented through numerical experiments in signal recovery problems. [ABSTRACT FROM AUTHOR]

In this paper, we proposed two different methods for solving pseudomonotone and strongly pseudomonotone equilibrium problems. We can examine these methods as an extension and improvement of the Popov's extragradient method. We replaced the second minimization problem onto a closed convex set in the Popov's extragradient method, with a half-space minimization problem that is updated on each iteration and also formulates a useful method for determining the appropriate stepsize on each iteration. The weak convergence theorem of the first method and strong convergence theorem for the second method is well-established based on a standard assumption on a cost bifunction. We also consider various numerical examples to support our well-established convergence results, and we can see that the proposed methods depict a significant improvement in terms of the number of iterations and execution time. [ABSTRACT FROM AUTHOR]