Analysis of Subgradient Extragradient Method for Variational Inequality Problems and Null Point Problems [PDF]
In this paper, we introduce a new numerical method for finding a common solution to variational inequality problems involving monotone mappings and null point problems involving a finite family of inverse-strongly monotone mappings.
Yanlai Song, Xinhong Chen
core +1 more source
Extragradient method with feasible inexact projection to variational inequality problem [PDF]
The variational inequality problem in finite-dimensional Euclidean space is addressed in this paper, and two inexact variants of the extragradient method are proposed to solve it.
Julien Ugon (13077438) +2 more
core +3 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
A Strongly Convergent Method for the Split Feasibility Problem
The purpose of this paper is to introduce and analyze a strongly convergent method which combined regularized method, with extragradient method for solving the split feasibility problem in the setting of infinite-dimensional Hilbert spaces. Note that the
Yonghong Yao +2 more
doaj +1 more source
An extragradient algorithm for solving general nonconvex variational inequalities [PDF]
In this work, we suggest and analyze an extragradient method for solving general nonconvex variational inequalities using the technique of the projection operator. We prove that the convergence of the extragradient method requires only pseudomonotonicity,
Noor, Muhammad Aslam
core +1 more source
Low-rank extragradient methods for scalable semidefinite optimization
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in statistics, machine learning, combinatorial optimization, and other domains.
Dan Garber, Atara Kaplan
openaire +2 more sources
Modified relaxed extragradient method for a general system of variational inequalities and nonexpansive [PDF]
The purpose of this paper is to introduce a new modified relaxed extragradient method and study for finding some common solutions for a general system of variational inequalities with inversestrongly monotone mappings and nonexpansive mappings in the ...
Yuanheng Wang, Liu Yang
core
A new modified extragradient method with Bregman divergence [PDF]
Предложен новый метод экстраградиентного типа для решения вариационных неравенств с псевдомонотонными и липшицевыми операторами, действующими в конечномерном линейном нормированном пространстве.
Семёнов, В.В.
core +1 more source
Modified extragradient method with Bregman divergence for variational inequalities [PDF]
Предложен новый метод екстраградиентного типа для приближенного решения вариационных неравенств с псевдомонотонными и липшицевимы операторами, действующими в конечномерном линейном нормированном пространстве.
Семенов, В.В.
core +5 more sources
We propose a hybrid extragradient method for finding a common element of the solution set of a variational inequality problem, the solution set of a general system of variational inequalities, and the fixed-point set of a strictly pseudocontractive ...
Guu Sy-Ming, Yao Jen-Chih, Ceng Lu-Chuan
doaj

