Solving asymmetric variational inequalities via convex optimization
Authors:
- Michele AghassiMAMichele Aghassi
- Dimitris BertsimasDBDimitris Bertsimas
- Georgia PerakisGPGeorgia Perakis
- 1 September 2006
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 34 (5) , 481-490
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Robust linear optimization under general normsOperations Research Letters, 2004
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality ProblemsSIAM Journal on Optimization, 1998
- Robust Solutions to Least-Squares Problems with Uncertain DataSIAM Journal on Matrix Analysis and Applications, 1997
- A unifying geometric solution framework and complexity analysis for variational inequalitiesMathematical Programming, 1995
- Global linear convergence of a path-following algorithm for some monotone variational inequality problemsJournal of Optimization Theory and Applications, 1992
- A polynomial-time algorithm for affine variational inequalitiesApplied Mathematics Letters, 1991
- Variational principles for variational inequalitiesNumerical Functional Analysis and Optimization, 1989
- Convex programming and variational inequalitiesJournal of Optimization Theory and Applications, 1972
- Variational inequalitiesCommunications on Pure and Applied Mathematics, 1967