{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:09:56Z","timestamp":1786979396211,"version":"3.56.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf01590959","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T16:06:59Z","timestamp":1114704419000},"page":"327-351","source":"Crossref","is-referenced-by-count":10,"title":["A unifying geometric solution framework and complexity analysis for variational inequalities"],"prefix":"10.1007","volume":"71","author":[{"given":"Thomas L.","family":"Magnanti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georgia","family":"Perakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Optimisation: Methodes Num\u00e9riques","author":"A. Auslender","year":"1976","unstructured":"A. Auslender,Optimisation: Methodes Num\u00e9riques (Masson, Paris, 1976)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","volume":"29","author":"R.G. Bland","year":"1981","unstructured":"R.G. Bland, D. Goldfarb and M. Todd, \u201cThe ellipsoid method: A survey,\u201dOperations Research 29 (1981) 1039\u20131091.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M. Dyer","year":"1991","unstructured":"M. Dyer, A. Friesz and R. Kannan, \u201cA random polynomial time algorithm for approximating the volume of convex bodies\u201dJournal of the Association for Computing Machinery 38 (1991) 1\u201317.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR4","first-page":"485","volume-title":"Networks, Handbook of Operations Research and Management Science","author":"M. Florian","year":"1995","unstructured":"M. Florian and D. Hearn, \u201cNetwork equilibria,\u201d in: M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds.,Networks, Handbook of Operations Research and Management Science (North-Holland, Amsterdam, 1995) pp. 485\u2013550."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"D. Gabay","year":"1983","unstructured":"D. Gabay, \u201cApplications of the method of multipliers to variational inequalities,\u201d in: M. Fortin and R. Glowinski, eds.,Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems (North-Holland, Amsterdam, 1983) pp. 299\u2013331."},{"key":"CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Groetschel","year":"1988","unstructured":"M. Groetschel, L. Lovasz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1287\/moor.12.4.678","volume":"12","author":"J.H. Hammond","year":"1987","unstructured":"J.H. Hammond and T.L. Magnanti, \u201cGeneralized descent methods for asymmetric systems of equations,\u201dMathematics of Operations Research 12 (1987) 678\u2013699.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","unstructured":"P.T. Harker, \u201cLectures on computation of equilibria with equation-based methods,\u201d Core Lecture Series (1993)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"P.T. Harker","year":"1990","unstructured":"P.T. Harker and J-S Pang, \u201cFinite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications,\u201dMathematical Programming 48 (1990) 161\u2013220.","journal-title":"Mathematical Programming"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(82)90049-9","volume":"1","author":"D.W. Hearn","year":"1982","unstructured":"D.W. Hearn, \u201cThe gap function of a convex program,\u201dOperations Research Letters 1 (2) (1982) 67\u201371.","journal-title":"Operations Research Letters"},{"key":"CR11","first-page":"1093","volume":"244","author":"L.G. Khatchyian","year":"1979","unstructured":"L.G. Khatchyian, \u201cA polynomial algorithm in linear programming,\u201dDoklady Akademii Nauk USSR 244 (1979) 1093\u20131096; translated in:Soviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Doklady Akademii Nauk USSR"},{"issue":"1","key":"CR12","first-page":"226","volume":"37","author":"L.G. Khatchyian","year":"1988","unstructured":"L.G. Khatchyian, S.P. Tarasov and I.I. Erlikh, \u201cThe method of inscribed ellipsoids,\u201dSoviet Mathematics Doklady 37 (1) (1988) 226\u2013230.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR13","first-page":"1244","volume":"160","author":"A.L. Levin","year":"1965","unstructured":"A.L. Levin, \u201cOn an algorithm for the minimization of convex functions,\u201dDoklady Akademii Nauk USSR 160 (1965) 1244\u20131247; translated in:Soviet Mathematics Doklady 6 (1965) 286\u2013290.","journal-title":"Doklady Akademii Nauk USSR"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics","author":"L. Lovasz","year":"1986","unstructured":"L. Lovasz,An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1986)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.10.3.515","volume":"10","author":"H.-J. Luthi","year":"1985","unstructured":"H.-J. Luthi, \u201cOn the solution of variational inequalities by the ellipsoid method,\u201dMathematics of Operations Research 10 (1985) 515\u2013522.","journal-title":"Mathematics of Operations Research"},{"key":"CR16","unstructured":"T.L. Magnanti and G. Perakis, \u201cA unifying geometric solution framework and complexity analysis for variational inequalities,\u201d Working paper OR 276-93, Operations Research Center, MIT (1993)."},{"key":"CR17","unstructured":"T.L. Magnanti and G. Perakis, \u201cOn the convergence of classical variational inequality algorithms,\u201d Working paper OR 280-93, Operations Research Center, MIT (1993)."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"T.L. Magnanti and G. Perakis, \u201cThe orthogonality theorem and the strong-f-monotonicity condition for variational inequality algorithms,\u201dSIAM Journal of Optimization, to appear.","DOI":"10.1137\/S1052623493259227"},{"key":"CR19","unstructured":"P. Marcotte and D. Zhu, \u201cCo-coercivity and its role in the convergence of iterative schemes for solving variational inequalities,\u201d Centre de Recherche sur les Transports, Universit\u00e9 de Montreal, preprint (1993)."},{"issue":"1","key":"CR20","first-page":"61","volume":"5","author":"B.S. Mityagin","year":"1969","unstructured":"B.S. Mityagin, \u201cTwo inequalities for the volume of convex bodies,\u201dMathematical Notes of the Academy of Sciences USSR 5 (1) (1969) 61\u201364.","journal-title":"Mathematical Notes of the Academy of Sciences USSR"},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-2178-1","volume-title":"Network Economics: A Variational Inequality Approach","author":"A. Nagurney","year":"1993","unstructured":"A. Nagurney,Network Economics: A Variational Inequality Approach (Kluwer, Dordrecht, 1993)."},{"key":"CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"CR23","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirovski","year":"1983","unstructured":"A.S. Nemirovski and D.B. Yudin,Problem Complexity and Method Efficiency in Optimization (Wiley, New York, 1983)."},{"key":"CR24","volume-title":"Handbook of Global Optimization","author":"J.S. Pang","year":"1994","unstructured":"J.S. Pang, \u201cComplementarity problems\u201d, in: R. Horst and P. Pardalos, eds,Handbook of Global Optimization (Kluwer, Dordrecht, 1994)."},{"key":"CR25","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"CR26","volume-title":"Geometric, interior point, and classical methods for solving finite dimensional variational inequality problems","author":"G. Perakis","year":"1993","unstructured":"G. Perakis, \u201cGeometric, interior point, and classical methods for solving finite dimensional variational inequality problems,\u201d Ph.D. dissertation, Department of Applied Mathematics, Brown University, Providence, RI (1993)."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor, \u201cCut off methods with space extension in convex programming problems,\u201dCybernetics 13 (1977) 94\u201396.","journal-title":"Cybernetics"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1007\/BF01068854","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor, \u201cNew development trends in nondifferential optimization,\u201dCybernetics 13 (1977) 881\u2013886.","journal-title":"Cybernetics"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01582258","volume":"48","author":"P. Tseng","year":"1990","unstructured":"P. Tseng, \u201cFurther applications of a matrix splitting algorithm to decomposition in variational inequalities and convex programming,\u201dMathematical Programming 48 (1990) 249\u2013264.","journal-title":"Mathematical Programming"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/SFCS.1989.63500","volume-title":"Proceedings of the 30th IEEE Symposium on Foundations of Computer Science","author":"P.M. Vaidya","year":"1989","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201d in:Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (IEEE Computer Soc. Press, Los Alamitos, CA, 1989) pp. 338\u2013343."},{"key":"CR31","unstructured":"S. Vavasis,Nonlinear Optimization; Complexity Issues (Oxford, New York, 1992)."},{"key":"CR32","first-page":"327","volume-title":"Proceedings IEEE Symposium on Foundations of Computer Science","author":"B. Yamnitsky","year":"1982","unstructured":"B. Yamnitsky and L.A. Levin, \u201cAn old linear programming algorithm runs in polynomial time,\u201dProceedings IEEE Symposium on Foundations of Computer Science (IEEE Computer Soc. Press, Los Alamitos, CA, 1982) pp. 327\u2013328."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01590959.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01590959\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01590959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T04:53:59Z","timestamp":1706158439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01590959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01590959"],"URL":"https:\/\/doi.org\/10.1007\/bf01590959","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}