Results 61 to 70 of about 681 (178)
In this research, the modified subgradient extragradient method and K‐mapping generated by a finite family of finite Lipschitzian demicontractions are introduced. Then, a strong convergence theorem for finding a common element of the common fixed point set of finite Lipschitzian demicontraction mappings and the common solution set of variational ...
Sarawut Suwannaut, Erhan Güler
wiley +1 more source
An Extragradient Method for Fixed Point Problems and Variational Inequality Problems
We present an extragradient method for fixed point problems and variational inequality problems. Using this method, we can find the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality
Yonghong Yao +2 more
doaj +2 more sources
We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping S in the intermediate sense and the set of solutions of the minimization ...
Lu-Chuan Ceng +2 more
doaj +1 more source
This paper aims to introduce an iterative algorithm based on an inertial technique that uses the minimum number of projections onto a nonempty, closed, and convex set. We show that the algorithm generates a sequence that converges strongly to the common solution of a variational inequality involving inverse strongly monotone mapping and fixed point ...
Watanjeet Singh +2 more
wiley +1 more source
This research focuses on developing a novel approach to finding fixed points of quasi-nonexpansive mappings without relying on the demi-closedness condition, a common requirement in previous studies. The approach is based on the Subgradient Extragradient
Anchalee Sripattanet, Atid Kangtunyakarn
doaj +1 more source
We introduce a new projection and contraction method with inertial and self-adaptive techniques for solving variational inequalities and split common fixed point problems in real Hilbert spaces.
Lateef Olakunle Jolaoso, Maggie Aphane
doaj +1 more source
In this short note, we provide a simple version of an accelerated forward-backward method (a.k.a. Nesterov’s accelerated proximal gradient method) possibly relying on approximate proximal operators and allowing to exploit strong convexity of the ...
Barré, Mathieu +2 more
doaj +1 more source
The Extragradient (EG) method stands as a cornerstone algorithm for solving monotone nonlinear equations but faces two important unresolved challenges: (i) how to select stepsizes without relying on the global Lipschitz constant or expensive line-search procedures, and (ii) how to reduce the two full evaluations of the mapping required per iteration to
Liu, Xiaozhi, Xia, Yong
openaire +2 more sources
Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration
We show that standard extragradient methods (i.e. mirror prox and dual extrapolation) recover optimal accelerated rates for first-order minimization of smooth convex functions. To obtain this result we provide a fine-grained characterization of the convergence rates of extragradient methods for solving monotone variational inequalities in terms of a ...
Cohen, Michael B. +2 more
openaire +4 more sources
A new self-adaptive method for solving resolvent of sum of two monotone operators in Banach spaces
We introduce a Tseng extragradient method for solving monotone inclusion problem in Banach space. A strong convergence result of an Halpern inertial extrapolation method for solving the resolvent of sum of two monotone operators without the knowledge of ...
H. A. Abass, M. Aphane, O. K. Oyewole
doaj +1 more source

