Results 1 to 10 of about 50 (50)

A self-adaptive inertial extragradient method for a class of split pseudomonotone variational inequality problems

Open Mathematics, 2023
In this article, we study a class of pseudomonotone split variational inequality problems (VIPs) with non-Lipschitz operator. We propose a new inertial extragradient method with self-adaptive step sizes for finding the solution to the aforementioned ...
Owolabi Abd-Semii Oluwatosin-Enitan, Alakoya Timilehin Opeyemi, Mewomo Oluwatosin Temitope   +2 more
doaj   +1 more source

A class of strongly convergent subgradient extragradient methods for solving quasimonotone variational inequalities

Demonstratio Mathematica, 2023
The primary goal of this research is to investigate the approximate numerical solution of variational inequalities using quasimonotone operators in infinite-dimensional real Hilbert spaces.
Rehman Habib ur, Kumam Poom, Ozdemir Murat, Yildirim Isa, Kumam Wiyada   +4 more
doaj   +1 more source

Inertial shrinking projection algorithm with self-adaptive step size for split generalized equilibrium and fixed point problems for a countable family of nonexpansive multivalued mappings

Demonstratio Mathematica, 2021
In this paper, we introduce a shrinking projection method of an inertial type with self-adaptive step size for finding a common element of the set of solutions of a split generalized equilibrium problem and the set of common fixed points of a countable ...
Olona Musa A., Alakoya Timilehin O., Owolabi Abd-semii O.-E., Mewomo Oluwatosin T.   +3 more
doaj   +1 more source

Two modifications of the inertial Tseng extragradient method with self-adaptive step size for solving monotone variational inequality problems

Demonstratio Mathematica, 2020
In this work, we introduce two new inertial-type algorithms for solving variational inequality problems (VIPs) with monotone and Lipschitz continuous mappings in real Hilbert spaces.
Alakoya Timilehin Opeyemi, Jolaoso Lateef Olakunle, Mewomo Oluwatosin Temitope   +2 more
doaj   +1 more source

Strong convergence inertial projection algorithm with self-adaptive step size rule for pseudomonotone variational inequalities in Hilbert spaces

Demonstratio Mathematica, 2021
In this paper, we introduce a new algorithm for solving pseudomonotone variational inequalities with a Lipschitz-type condition in a real Hilbert space.
Wairojjana Nopparat, Pakkaranang Nuttapol, Pholasa Nattawut   +2 more
doaj   +1 more source

A self-adaptive Tseng extragradient method for solving monotone variational inequality and fixed point problems in Banach spaces

Demonstratio Mathematica, 2021
In this paper, we introduce a self-adaptive projection method for finding a common element in the solution set of variational inequalities (VIs) and fixed point set for relatively nonexpansive mappings in 2-uniformly convex and uniformly smooth real ...
Jolaoso Lateef Olakunle
doaj   +1 more source

Convergence theorems for monotone vector field inclusions and minimization problems in Hadamard spaces

Analysis and Geometry in Metric Spaces, 2023
This article analyses two schemes: Mann-type and viscosity-type proximal point algorithms. Using these schemes, we establish Δ-convergence and strong convergence theorems for finding a common solution of monotone vector field inclusion problems, a ...
Salisu Sani, Kumam Poom, Sriwongsa Songpon   +2 more
doaj   +1 more source

Strong convergence of a self-adaptive inertial Tseng's extragradient method for pseudomonotone variational inequalities and fixed point problems

Open Mathematics, 2022
In this paper, we study the problem of finding a common solution of the pseudomonotone variational inequality problem and fixed point problem for demicontractive mappings.
Uzor Victor Amarachi, Alakoya Timilehin Opeyemi, Mewomo Oluwatosin Temitope   +2 more
doaj   +1 more source

Split equality variational inequality problems for pseudomonotone mappings in Banach spaces

, 2021
A new algorithm for approximating solutions of the split equality variational inequality problems (SEVIP) for pseudomonotone mappings in the setting of Banach spaces is introduced. Strong convergence of the sequence generated by the proposed algorithm to
BOIKANYO, Oganeditse A., ZEGEYE, Habtu
core   +1 more source

A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem

EURO Journal on Computational Optimization, 2019
The plain Newton-min algorithm for solving the linear complementarity problem (LCP) “0⩽x⊥(Mx+q)⩾0” can be viewed as an instance of the plain semismooth Newton method on the equational version “min(x,Mx+q)=0” of the problem.
Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert   +2 more
doaj   +1 more source