Results 11 to 20 of about 2,112 (158)
Parallel Extragradient-Proximal Methods for Split Equilibrium Problems [PDF]
In this paper, we introduce two parallel extragradient-proximal methods for solving split equilibrium problems. The algorithms combine the extragradient method, the proximal method and the shrinking projection method.
Dang Van Hieu
doaj +7 more sources
An Implicit Extragradient Method for Hierarchical Variational Inequalities [PDF]
As a well-known numerical method, the extragradient method solves numerically the variational inequality of finding such that , for all . In this paper, we devote to solve the following hierarchical variational inequality Find such that , for
Liou YeongCheng, Yao Yonghong
doaj +4 more sources
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 mappings.
Lin, Tianyi +2 more
openaire +6 more sources
Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization [PDF]
We study the extension of the Chambolle--Pock primal-dual algorithm to nonsmooth optimization problems involving nonlinear operators between function spaces. Local convergence is shown under technical conditions including metric regularity of the corresponding primal-dual optimality conditions.
Clason, Christian, Valkonen, Tuomo
openaire +7 more sources
Extended Extragradient Methods for Generalized Variational Inequalities [PDF]
We suggest a modified extragradient method for solving the generalized variational inequalities in a Banach space. We prove some strong convergence results under some mild conditions on parameters. Some special cases are also discussed.
Yonghong Yao +3 more
doaj +3 more sources
Extragradient subgradient methods for solving bilevel equilibrium problems. [PDF]
In this paper, we propose two algorithms for finding the solution of a bilevel equilibrium problem in a real Hilbert space. Under some sufficient assumptions on the bifunctions involving pseudomonotone and Lipschitz-type conditions, we obtain the strong convergence of the iterative sequence generated by the first algorithm.
Yuying T, Dinh BV, Kim DS, Plubtieng S.
europepmc +6 more sources
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 +4 more sources
Extragradient method for convex minimization problem [PDF]
Abstract In this paper, we introduce and analyze a multi-step hybrid extragradient algorithm by combining Korpelevich’s extragradient method, the viscosity approximation method, the hybrid steepest-descent method, Mann’s iteration method and the gradient-projection method (GPM) with regularization in the setting of infinite-dimensional ...
Ceng, Lu-Chuan +2 more
openaire +4 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

