Projection generalized two-step extragradient methods for equilibrium problems
|Annotation||Projection generalized two-step extragradient methods for solving of equilibrium programming problems are proposed whereby the saddle points are found on convex-concave continuously differentiable function with Lipschitz gradients specified on subset of the Euclidean space. For two methods the convergence and rate of convergence of the method are studied with the aid of tools from convex analysis, without requirement of strongly convexity or strongly monotony.|
|Keywords||convex concave function, equilibrium problem, projection generalized two-step extragradient methods.|
1Assistant Professor of Ulyanovsk State University, Ulyanovsk; firstname.lastname@example.org.
Citation: V.G. Malinov , "[Projection generalized two-step extragradient methods for equilibrium problems ]", Zhurnal Srednevolzhskogo matematicheskogo obshchestva,14:2 (2012) 87–104 (In Russian)