Results 61 to 70 of about 748 (130)
This manuscript aims to incorporate an inertial scheme with Popov’s subgradient extragradient method to solve equilibrium problems that involve two different classes of bifunction.
Habib ur Rehman +4 more
doaj +1 more source
A Partial Regularization Method for Saddle Point Seeking [PDF]
This article generalizes the Nash equilibrium approach to linear programming to the saddle point problem. The problem is shown to be equivalent to a non-zero sum game in which objectives of the players are obtained by partial regularization of the ...
Ruszczynski, A.
core
A new modified subgradient extragradient method for solving variational inequalities
The goal of the note is to introduce a new modified subgradient extragradient algorithm for solving variational inequalities in Hilbert spaces.
Migórski, Stanisław +2 more
openaire +2 more sources
In this paper, we propose new methods for finding a common solution to pseudomonotone and Lipschitz-type equilibrium problems, as well as a fixed-point problem for demicontractive mapping in real Hilbert spaces.
Bancha Panyanak +3 more
doaj +1 more source
An Extragradient-Based Alternating Direction Method for Convex Minimization [PDF]
In this paper, we consider the problem of minimizing the sum of two convex functions subject to linear linking constraints. The classical alternating direction type methods usually assume that the two convex functions have relatively easy proximal ...
Lin, Tianyi +2 more
core +1 more source
Image and signal recovery via a novel alternating golden ratio two-subgradient extragradient method
We introduce and analyze a novel two-subgradient extragradient method (TSEGM) for solving monotone variational inequality problems (VIPs) in real Hilbert spaces.
Habib ur Rehman +3 more
doaj +1 more source
A number of applications from mathematical programmings, such as minimax problems, penalization methods and fixed-point problems can be formulated as a variational inequality model.
Nopparat Wairojjana +4 more
doaj +1 more source
Fixed points in the family of convex representations of a maximal monotone operator
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation.
Svaiter, B. F.
core +1 more source
In this research, the modified subgradient extragradient method and K-mapping generated by a finite family of finite Lipschitzian demicontractions are introduced.
Sarawut Suwannaut
doaj +1 more source
A subgradient extragradient algorithm for solving monotone variational inequalities in Banach spaces
In this paper, we introduce an algorithm for solving classical variational inequalities problem with Lipschitz continuous and monotone mapping in Banach space. We modify the subgradient extragradient methods with a new and simple iterative step size, the
Fei Ma
doaj +1 more source

