Search

We introduce two new iterative algorithms with line-search process for solving a variational inequality problem with pseudomonotone and Lipschitz continuous mapping and a common fixed-point problem of an asymptotically nonexpansive mapping and a strictly pseudocontractive mapping. The proposed algorithms are based on inertial subgradient extragradient method with line-search process, hybrid steepest-descent method, and viscosity approximation method. Under mild conditions, we prove strong convergence of the proposed algorithms in a real Hilbert space. [ABSTRACT FROM AUTHOR]

This article proposes two general inertial algorithms with line-search process for finding a solution of a variational inequality problem with fixed-point constraints via a subgradient-extragradient approach. Common solution theorems are obtained in Hilbert spaces. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a general viscosity implicit iterative method for finding a solution of a split variational inclusion problem (SVIP) with a hierarchical variational inequality (HVI) constraint for a countable family of nonexpansive mappings in Hilbert spaces. Strong convergence theorem is obtained under some mild assumptions [ABSTRACT FROM AUTHOR]

In this paper, we introduce and analyze a multi-step hybrid steepest-descent algorithm by combining Korpelevich's extragradient method, viscosity approximation method, hybrid steepest-descent method, Mann's iteration method and gradient-projection method (GPM) with regularization in the setting of infinitedimensional Hilbert spaces. Strong convergence was established. [ABSTRACT FROM AUTHOR]

Abstract: The purpose of this paper is to introduce and analyze an extragradient method with regularization for finding a common element of the solution set of the split feasibility problem and the set of fixed points of a nonexpansive mapping in the setting of infinite-dimensional Hilbert spaces. Combining the regularization method and the extragradient method due to Nadezhkina and Takahashi [N. Nadezhkina, W. Takahashi, Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings, J. Optim. Theory Appl. 128 (2006) 191–201], we propose an iterative algorithm for finding an element of . We prove that the sequences generated by the proposed algorithm converge weakly to an element of under mild conditions. [Copyright &y& Elsevier]

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions. [ABSTRACT FROM AUTHOR]

In this article, we introduce two hybrid proximal-type algorithms and two hybrid shrinking projection algorithms by using the hybrid proximal-type method and the hybrid shrinking projection method, respectively, for finding a common element of the set of solutions of an equilibrium problem, the set of fixed points of a relatively nonexpansive mapping, and the set of solutions to the equation 0 ∈ Tx for a maximal monotone operator T defined on a uniformly smooth and uniformly convex Banach space. The strong convergence of the sequences generated by the proposed algorithms is established. Our results improve and generalize several known results in the literature. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce and study two hybrid proximal-point algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of solutions to the equation 0∈ Tx for a maximal monotone operator T in a uniformly smooth and uniformly convex Banach space X. Strong and weak convergence results of these two hybrid proximal-point algorithms are established, respectively. [ABSTRACT FROM AUTHOR]

This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued variational inclusion problems. Characterization of strong convergence of this iterative method is established. [ABSTRACT FROM AUTHOR]

Let C be a nonempty closed convex subset of a Banach space E with the dual E*, let T : C → E* be a continuous mapping, and let S : C → C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator we study the variational inequality (for short, VI(T - f,C)): find x ϵ C such that ⩾ 0 for all y ϵ C, where f ϵ E* is a given element. By combining the approximate proximal point scheme both with the modified Ishikawa iteration and with the modified Halpern iteration for relatively nonexpansive mappings, respectively, we propose two modified versions of the approximate proximal point scheme L. C. Ceng and J. C. Yao (2008) for finding approximate solutions of the VI(T - f,C). Moreover, it is proven that these iterative algorithms converge strongly to the same solution of the VI(T - f,C), which is also a fixed point of S. [ABSTRACT FROM AUTHOR]

The article presents a discussion that looks into the wide class of inexact proximal-type methods for handling the generalized variational inequality problem with maximal monotone operator in a reflexive Banach space. An extension of Kamimura and Takahashi's algorithm is also provided with the aim of developing a generic inexact proximal point algorithm. A convergence analysis which unifies a broad class of proximal-type methods associated with finding Hilbert spaces or Banach spaces is also included.