Treffer: The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach.

We introduce a cutting-plane, analytic-center algorithm for strongly monotone variational inequalities (VIs).. The approach extends that of Goffin et al. (1997) and Denault and Goffin (1999). The VI is still treated as a convex feasibility problem, with linear cuts progressively shrinking a localization set that contains the solution of the VI. However, a quadratic cut is used to improve the positioning of the point at which the next cut will be generated. Our approach uses quadratic, ellipsoidal cuts, based on the symmetrized Jacobian of the VI. Since it cannot be guaranteed that such quadratic cuts do not cut off the solution of the VI, they are used only for direction, and are not integrated as such in the localization set; the linear part of the quadratic cuts can safely be added to the localization set. The introduction of the quadratic cut together with the drop of the quadratic part of the previous cut is studied careful1y. Numerical results are given that illustrate the substantial improvement that quadratic cuts can yield over linear cuts. [ABSTRACT FROM AUTHOR]

Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)