zbMATH — the first resource for mathematics

A variant of Korpelevich’s method for variational inequalities with a new search strategy. (English) Zbl 0891.90135
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.

90C25 Convex programming
49J40 Variational inequalities
90C30 Nonlinear programming
90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Full Text: DOI
[1] Armijo L., Pacific Journal of Mathematics 16 pp 1– (1966) · Zbl 0202.46105
[2] Bertsekas D., Parallel and Distributed Computation: Numerical Methods (1989) · Zbl 0743.65107
[3] DOI: 10.1109/TAC.1980.1102537 · Zbl 0483.49027
[4] DOI: 10.1007/BF01582255 · Zbl 0734.90098
[5] DOI: 10.1007/BF01581141 · Zbl 0813.49009
[6] Iusem A.N., Computational and Applied Mathematics 13 pp 103– (1994)
[7] DOI: 10.1016/0041-5553(87)90058-9 · Zbl 0665.90078
[8] Korpelevich G.M., Ekonomika i Matematcheskie Metody 12 pp 747– (1976)
[9] Marcotte P., Information Systems and Operational Research 29 pp 258– (1991) · Zbl 0781.90086
[10] Solodov M. V., A new projection method for monotone variational inequality problems (1997)
[11] DOI: 10.1137/S0363012994268655 · Zbl 0866.49018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.