Abstract:
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.
First page:
PDF פאיכ