Department of Mathematics
Steplengths in the extragradient type methods
The extragradient type methods are a class of efficient direct methods. For solving monotone variational inequalities, these methods only require function evaluation, and therefore are widely applied to black-box models. In this type of methods, the distance between the iterate and a fixed solution point decreases by iterations. Furthermore, in each iteration, the negative increment of such squared distance has a differentiable concave lower bound function without requiring any solution in its formula. In this paper, we investigate some properties for the lower bound. Our study reveals that the lower bound affords a steplength domain which guarantees the convergence of the entire algorithm. Based on these results, we present two new steplengths. One involves the projection onto the tangent cone without line search, while the other can be computed via searching the positive root of a one dimension concave lower bound function. Our preliminary numerical results confirm and illustrate the attractiveness of our contributions. © 2009 Elsevier B.V. All rights reserved.
Black-box model, Extragradient type methods, Monotone variational inequalities, Projection
Source Publication Title
Journal of Computational and Applied Mathematics
Link to Publisher's Edition
Wang, X., He, B., & Liao, L. (2010). Steplengths in the extragradient type methods. Journal of Computational and Applied Mathematics, 233 (11), 2925-2939. https://doi.org/10.1016/j.cam.2009.11.037