Results 21 to 30 of about 681 (178)

Extension of Extragradient Techniques for Variational Inequalities

open access: yesMathematics, 2019
An extragradient type method for finding the common solutions of two variational inequalities has been proposed. The convergence result of the algorithm is given under mild conditions on the algorithm parameters.
Yonghong Yao   +3 more
doaj   +2 more sources

Strong Convergence of a Modified Extragradient Method to the Minimum-Norm Solution of Variational Inequalities [PDF]

open access: yesAbstract and Applied Analysis, 2012
We suggest and analyze a modified extragradient method for solving variational inequalities, which is convergent strongly to the minimum-norm solution of some variational inequality in an infinite-dimensional Hilbert space.
Yonghong Yao   +2 more
doaj   +2 more sources

A doublestep extragradient method for solving a resource management problem

open access: yesМоделирование и анализ информационных систем, 2010
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

A modified subgradient extragradient method for solving monotone variational inequalities. [PDF]

open access: yesJ Inequal Appl, 2017
In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function.
He S, Wu T.
europepmc   +2 more sources

Extragradient Method in Optimization: Convergence and Complexity [PDF]

open access: yesJournal of Optimization Theory and Applications, 2017
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   +4 more sources

Hybrid Alternated Inertial Projection and Contraction Algorithm for Solving Bilevel Variational Inequality Problems

open access: yesJournal of Mathematics, Volume 2023, Issue 1, 2023., 2023
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

Convergence Analysis of New Construction Explicit Methods for Solving Equilibrium Programming and Fixed Point Problems

open access: yesJournal of Function Spaces, Volume 2022, Issue 1, 2022., 2022
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

Two New Weak Convergence Algorithms for Solving Bilevel Pseudomonotone Equilibrium Problem in Hilbert Space

open access: yesJournal of Mathematics, Volume 2022, Issue 1, 2022., 2022
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

Decentralized Stochastic Variance Reduced Extragradient Method

open access: yesCoRR, 2022
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

Convergence Analysis of a Modified Forward‐Backward Splitting Algorithm for Minimization and Application to Image Recovery

open access: yesComputational and Mathematical Methods, Volume 2022, Issue 1, 2022., 2022
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

Home - About - Disclaimer - Privacy