A unifying geometric solution framework and complexity analysis for variational inequalities

Mathematical Programming

Volumn 71, Issue 3, 1995, Pages 327-351

  Magnanti, Thomas L ^a,b   Perakis, Georgia ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Complexity analysis; Monotone operators; Nonlinear programming; Variational inequalities

Indexed keywords

EID: 0003303688     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01590959     Document Type: Article

References (32)

1. The ellipsoid method: A survey
2. A random polynomial time algorithm for approximating the volume of convex bodies
3. Network equilibria
4. Applications of the method of multipliers to variational inequalities
5. Generalized descent methods for asymmetric systems of equations
6. Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications
7. The gap function of a convex program
8. A polynomial algorithm in linear programming
9. The method of inscribed ellipsoids
10. On an algorithm for the minimization of convex functions
11. On the solution of variational inequalities by the ellipsoid method
12. Two inequalities for the volume of convex bodies
13. Complementarity problems
14. Cut off methods with space extension in convex programming problems
15. New development trends in nondifferential optimization
16. Further applications of a matrix splitting algorithm to decomposition in variational inequalities and convex programming
17. A new algorithm for minimizing convex functions over convex sets
18. An old linear programming algorithm runs in polynomial time