Results 21 to 30 of about 10,988,230 (174)
New Approximate Schemes for Generalized General Set-Valued Mixed Quasi Variational Inequalities [PDF]
In this paper, we suggest and consider a class of new three-step approximation schemes for generalized general set-valued mixed quasi variational inequalities.
Shi, Chaofeng
core +6 more sources
A doublestep extragradient method for solving a resource management problem
In the article is proposed a doublestep extragradient method for solving nonintrinsic problems of linear programming, variational inequalities and some related problems. The convergence of this method in general case is proved.
A. V. Zykina, N. V. Melenchuk
doaj +1 more source
Extragradient Method in Optimization: Convergence and Complexity [PDF]
We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka-Lojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a critical point of the problem and has finite length.
Trong Phong Nguyen +3 more
openaire +5 more sources
This paper considers an alternated inertial‐type extrapolation algorithm for solving bilevel pseudomonotone variational inequality problem in the framework of real Hilbert spaces with split variational inequality and fixed‐point constraints of demimetric mapping.
Jacob Ashiwere Abuchu +5 more
wiley +1 more source
Decentralized Stochastic Variance Reduced Extragradient Method
This paper studies decentralized convex-concave minimax optimization problems of the form $\min_x\max_y f(x,y) \triangleq\frac{1}{m}\sum_{i=1}^m f_i(x,y)$, where $m$ is the number of agents and each local function can be written as $f_i(x,y)=\frac{1}{n}\sum_{j=1}^n f_{i,j}(x,y)$.
Luo Luo, Haishan Ye
openaire +2 more sources
In this paper, we present improved iterative methods for evaluating the numerical solution of an equilibrium problem in a Hilbert space with a pseudomonotone and a Lipschitz‐type bifunction. The method is built around two computing phases of a proximal‐like mapping with inertial terms.
Chainarong Khunpanuk +3 more
wiley +1 more source
In this paper, we introduce two new subgradient extragradient algorithms to find the solution of a bilevel equilibrium problem in which the pseudomonotone and Lipschitz‐type continuous bifunctions are involved in a real Hilbert space. The first method needs the prior knowledge of the Lipschitz constants of the bifunctions while the second method uses a
Gaobo Li, Sun Young Cho
wiley +1 more source
Many applications in applied sciences and engineering can be considered as the convex minimization problem with the sum of two functions. One of the most popular techniques to solve this problem is the forward‐backward algorithm. In this work, we aim to present a new version of splitting algorithms by adapting with Tseng’s extragradient method and ...
Kunrada Kankam +3 more
wiley +1 more source
In this paper, we introduce a new extragradient algorithm by using generalized metric projection. We prove a strong convergence theorem for finding a common element of the solution set of split feasibility problem and the set of fixed points of relatively nonexpansive mapping and a finite family of resolvent operator and the set of solutions of an ...
Mostafa Ghadampour, Giovanni Di Fratta
wiley +1 more source
A Forward‐Backward‐Forward Algorithm for Solving Quasimonotone Variational Inequalities
In this paper, we continue to investigate the convergence analysis of Tseng‐type forward‐backward‐forward algorithms for solving quasimonotone variational inequalities in Hilbert spaces. We use a self‐adaptive technique to update the step sizes without prior knowledge of the Lipschitz constant of quasimonotone operators.
Tzu-Chien Yin +2 more
wiley +1 more source

