Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0891.90135
Iusem, A.N.; Svaiter, B.F.
A variant of Korpelevich's method for variational inequalities with a new search strategy. (English)
[J] Optimization 42, No.4, 309-321 (1997), addendum ibid. 43, No.1, 85 (1998). ISSN 0233-1934; ISSN 1029-4945/e

Summary: We present a variant of Korpelevich's method for variational inequality problems with monotone operators. Instead of a fixed and exogenously given stepsize, possible only when a Lipschitz constant for the operator exists and is known beforehand, we find an appropriate stepsize in each iteration through an Armijo-type search. Differently from other similar schemes, we perform only two projections onto the feasible set in each iteration, rather than one projection for each tentative step during the search, which represents a considerable saving when the projection is computationally expensive. A full convergence analysis is given, without any Lipschitz continuity assumption.

MSC 2000:: *90C25 Convex programming
49J40 Variational methods including variational inequalities
90C30 Nonlinear programming
90C33 Complementarity problems

Keywords: Armijo search; Korpelevich's method; variational inequality; monotone operators; convergence analysis

Cited in: Zbl 1039.49014

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]