Search

This paper investigates the Bregman version of the Takahashi-type generic 2-generalized nonspreading mapping which includes the generic 2-generalized Bregman nonspreading mapping as a special case. Relative to the attractive points of nonlinear mapping, the Baillon-type nonlinear mean convergence theorem for finite commutative generic 2-generalized Bregman nonspreading mappings without the convexity assumption is proved in the setting of reflexive Banach spaces. Using this result, some new and well-known nonlinear mean convergence theorems for the finite generic generalized Bregman nonspreading mapping, the 2-generalized Bregman nonspreading mapping and the normally 2-generalized hybrid mapping, among others, are established. Our results extend and generalize many corresponding ones announced in the literature. [ABSTRACT FROM AUTHOR]

In a real Hilbert space, we aim to investigate two modified Mann subgradient-like methods to find a solution to pseudo-monotone variational inequalities, which is also a common fixed point of a finite family of nonexpansive mappings and an asymptotically nonexpansive mapping. We obtain strong convergence results for the sequences constructed by these proposed rules. We give some examples to illustrate our analysis. [ABSTRACT FROM AUTHOR]

We propose two Mann-type subgradient-like extra gradient iterations with the line-search procedure for hierarchical variational inequality (HVI) with the common fixed-point problem (CFPP) constraint of finite family of nonexpansive mappings and an asymptotically nonexpansive mapping in a real Hilbert space. Our methods include combinations of the Mann iteration method, subgradient extra gradient method with the line-search process, and viscosity approximation method. Under suitable assumptions, we obtain the strong convergence results of sequence of iterates generated by our methods for a solution to HVI with the CFPP constraint. [ABSTRACT FROM AUTHOR]

Our main focus in this work is the classical variational inequality problem with Lipschitz continuous and pseudo-monotone mapping in real Hilbert spaces. An adaptive reflected subgradient-extragradient method is presented along with its weak convergence analysis. The novelty of the proposed method lies in the fact that only one projection onto the feasible set in each iteration is required, and there is no need to know/approximate the Lipschitz constant of the cost function a priori. To illustrate and emphasize the potential applicability of the new scheme, several numerical experiments and comparisons in tomography reconstruction, Nash–Cournot oligopolistic equilibrium, and more are presented. [ABSTRACT FROM AUTHOR]

The forward–backward–forward (FBF) splitting method is a popular iterative procedure for finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. In this paper, we introduce a forward–backward–forward splitting method with reflection steps (symmetric) in real Hilbert spaces. Weak and strong convergence analyses of the proposed method are established under suitable assumptions. Moreover, a linear convergence rate of an inertial modified forward–backward–forward splitting method is also presented. [ABSTRACT FROM AUTHOR]

In this paper, we give a general inertial Krasnoselskii–Mann algorithm for solving inclusion problems in Banach Spaces. First, we establish a weak convergence in real uniformly convex and q-uniformly smooth Banach spaces for finding fixed points of nonexpansive mappings. Then, a strong convergence is obtained for the inertial generalized forward-backward splitting method for the inclusion. Our results extend many recent and related results obtained in real Hilbert spaces. [ABSTRACT FROM AUTHOR]

The aim of this article is to study two efficient parallel algorithms for obtaining a solution to a system of monotone variational inequalities (SVI) on Hadamard manifolds. The parallel algorithms are inspired by Tseng's extragradient techniques with new step sizes, which are established without the knowledge of the Lipschitz constants of the operators and line-search. Under the monotonicity assumptions regarding the underlying vector fields, one proves that the sequences generated by the methods converge to a solution of the monotone SVI whenever it exists. [ABSTRACT FROM AUTHOR]

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). [ABSTRACT FROM AUTHOR]