A unifying geometric solution framework and complexity analysis for variational inequalities
Authors:
- Thomas L. MagnantiTMThomas L. Magnanti
- Georgia PerakisGPGeorgia Perakis
- 1 December 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 71 (3) , 327-351
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality AlgorithmsSIAM Journal on Optimization, 1997
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programmingMathematical Programming, 1990
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applicationsMathematical Programming, 1990
- Generalized Descent Methods for Asymmetric Systems of EquationsMathematics of Operations Research, 1987
- On the Solution of Variational Inequalities by the Ellipsoid MethodMathematics of Operations Research, 1985
- Chapter IX Applications of the Method of Multipliers to Variational Inequalities1983
- The gap function of a convex programOperations Research Letters, 1982
- Feature Article—The Ellipsoid Method: A SurveyOperations Research, 1981
- New development trends in nondifferentiable optimizationCybernetics and Systems Analysis, 1978