Abstract
We present an algorithm for variational inequalities VI({\cal F}, Y) that uses a primal-dual version of the Analytic Center Cutting Plane Method. The point-to-set mapping {\cal F} is assumed to be monotone, or pseudomonotone. Each computation of a new analytic center requires at most four Newton iterations, in theory, and in practice one or sometimes two. Linear equalities that may be included in the definition of the set Y are taken explicitly into account. We report numerical experiments on several well—known variational inequality problems as well as on one where the functional results from the solution of large subproblems. The method is robust and competitive with algorithms which use the same information as this one.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
