DSpace Repository

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

Show simple item record

dc.creator Perakis, Georgia
dc.creator Zaretsky, M. (Marina)
dc.date 2004-05-28T19:23:05Z
dc.date 2004-05-28T19:23:05Z
dc.date 2002-01
dc.date.accessioned 2013-10-09T02:37:45Z
dc.date.available 2013-10-09T02:37:45Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/5099
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.format 1935133 bytes
dc.format application/pdf
dc.language en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center
dc.relation Operations Research Center Working Paper;OR 360-02
dc.subject Variational inequalities, Interior-point methods, Affine Scaling, Cutting Plane Methods AMS Subject Classifications: Primary 90C06; Secondary 90C25
dc.title On the Efficient Solution of Variational Inequalities; Complexity and Computational Efficiency
dc.type Working Paper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account