Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. On the Efficient Solution of Variational Inequalities; Complexity and Computational Efficiency

On the Efficient Solution of Variational Inequalities; Complexity and Computational Efficiency

Thumbnail Image
Download
Name

OR-360-02.pdf

Size

1.85 MB

Format

Adobe PDF

Checksum (MD5)

45ca6bd6bf3ef7b85a3c0145e2665344

Author(s)
Perakis, Georgia
•
Zaretsky, M. (Marina)
Date Issued
January 2002
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 360-02
Abstract
In this paper we combine ideas from cutting plane and interior point methods in order to solve variational inequality problems efficiently. In particular, we introduce a general framework that incorporates nonlinear as well as linear "smarter" cuts. These cuts utilize second order information on the problem through the use of a gap function. We establish convergence as well as complexity results for this framework. Moreover, in order to devise more practical methods, we consider an affine scaling method as it applies to symmetric, monotone variationalinequality problems and demonstrate its convergence. Finally, in order to further improve the computational efficiency of the methods in this paper, we combine the cutting plane approach with the affine scaling approach.
Subjects
Variational inequalities, Interior-point methods, Affine Scaling, Cutting Plane Methods AMS Subject Classifications: Primary 90C06; Secondary 90C25
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5099
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.