We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Massachusetts Institute of Technology, Operations Research Center
Abstract
In this paper, we propose a concept of polynomiality for variational inequality problems and show how to find a near optimal solution of variational inequality problems in a polynomial number of iterations. To establish this result we build upon insights from several algorithms for linear and nonlinear programs (the ellipsoid algorithm, the method of centers of gravity, the method of inscribed ellipsoids, and Vaidya's algorithm) to develop a unifying geometric framework for solving variational inequality problems. The analysis rests upon the assumption of strong-f-monotonicity, which is weaker than strict and strong monotonicity. Since linear programs satisfy this assumption, the general framework applies to linear programs
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.