{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:21:39Z","timestamp":1692429699446},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992,1]]},"DOI":"10.1007\/bf01585708","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:34:23Z","timestamp":1114677263000},"page":"297-306","source":"Crossref","is-referenced-by-count":13,"title":["Complexity analysis of a linear complementarity algorithm based on a Lyapunov function"],"prefix":"10.1007","volume":"53","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Mathematical Programming Study 7:Complementarity and Fixed Point Problems","year":"1987","unstructured":"M.L. Balinski and R.W. Cottle, eds.,Mathematical Programming Study 7:Complementarity and Fixed Point Problems (North-Holland, Amsterdam, 1987)."},{"key":"CR2","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, New York, 1982)."},{"key":"CR3","volume-title":"Variational Inequalities and Complementarity Problems: Theory and Applications","year":"1980","unstructured":"R.W. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complementarity Problems: Theory and Applications (Wiley, New York, 1980)."},{"key":"CR4","volume-title":"\u201cProjective transformations for interior point methods, part I: Basic theory and linear programming,\u201d OR 179-88","author":"R.M. Freund","year":"1988","unstructured":"R.M. Freund, \u201cProjective transformations for interior point methods, part I: Basic theory and linear programming,\u201d OR 179-88, Operations Research Center, M.I.T. (Cambridge, MA, 1988)."},{"key":"CR5","volume-title":"\u201cProjective transformations for interior point methods, part II: Analysis of an algorithm for finding the weighted center of a polyhedral system,\u201d OR 180-88","author":"R.M. Freund","year":"1988","unstructured":"R.M. Freund, \u201cProjective transformations for interior point methods, part II: Analysis of an algorithm for finding the weighted center of a polyhedral system,\u201d OR 180-88, Operations Research Center, M.I.T. (Cambridge, MA, 1988)."},{"key":"CR6","unstructured":"R.M. Freund, Private communication (September 1988)."},{"key":"CR7","volume-title":"Pathways to Solutions, Fixed Points, and Equilibria","author":"C.B. Garcia","year":"1981","unstructured":"C.B. Garcia and W.I. Zangwill,Pathways to Solutions, Fixed Points, and Equilibria (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"26","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 26 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1991","unstructured":"D. Goldfarb and S. Liu, \u201cAn O(n 3 L) primal interior point algorithm for convex quadratic programming,\u201dMathematical Programming 49 (1991) 325\u2013340.","journal-title":"Mathematical Programming"},{"key":"CR10","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior-Point and Related Methods (Springer, New York, 1989)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR13","volume-title":"\u201cAn O( $$\\sqrt n$$ L","author":"M. Kojima","year":"1988","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cAn O(306-1) iteration potential reduction algorithm for linear complementarity problems,\u201d Research Report, Department of Information Sciences, Tokyo Institute of Technology (Tokyo, Japan, 1988)."},{"key":"CR14","volume-title":"An interior point potential reduction algorithm for the linear complementarity problem","author":"M. Kojima","year":"1988","unstructured":"M. Kojima, N. Megiddo and Y. Ye, \u201cAn interior point potential reduction algorithm for the linear complementarity problem,\u201d in preparation, IBM Almaden Research Center (San Jose, CA, 1988)."},{"key":"CR15","unstructured":"M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, \u201cPolynomial solvability of convex quadratic programming,\u201dDoklady Akademiia Nauk SSSR 248 (1979). [Translated inSoviet Mathematics Doklady 20 (1979) 1108\u20131111.]"},{"key":"CR16","volume-title":"Introduction to Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1973","unstructured":"D.G. Luenberger,Introduction to Linear and Nonlinear Programming (Addison-Wesley, Reading, MA, 1973)."},{"key":"CR17","first-page":"1","volume-title":"Mathematical Programming Study 25:Mathematical Programming Essays in Honor of George B. Dantzig II","author":"O.L. Mangasarian","year":"1985","unstructured":"O.L. Mangasarian, \u201cSimple Computable Bounds for Solutions of Linear Complementarity Problems and Linear Programs,\u201dMathematical Programming Study 25:Mathematical Programming Essays in Honor of George B. Dantzig II (North-Holland, Amsterdam, 1985) pp. 1\u201312."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/moor.15.2.342","volume":"15","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra and J. Sun, \u201cAn algorithm for convex quadratic programming that requires O(n 3.5 L) arithmetic operations,\u201dMathematics of Operations Research 15 (1990) 342\u2013362.","journal-title":"Mathematics of Operations Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR20","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Helderman-Verlag, Berlin, 1988)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00934130","volume":"42","author":"J.-S. Pang","year":"1984","unstructured":"J.-S. Pang, \u201cNecessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem,\u201dJournal of Optimization Theory and Applications 42 (1984) 1\u201317.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"key":"CR23","first-page":"6","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cUtilization of the operation of space dilation in the minimization of convex functions,\u201dKibernetika 6 (1970) 6\u201312. [Translated inCybernetics 13 (1970) 94\u201396.]","journal-title":"Kibernetika"},{"key":"CR24","volume-title":"An \u2018analytical center\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, \u201cAn \u2018analytical center\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201d Preprint, Department of Numerical Analysis, Institute of Mathematics Eotvos University (Budapest, Hungary, 1985)."},{"key":"CR25","volume-title":"\u201cA locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope,\u201d Technical Report","author":"P. Vaidya","year":"1987","unstructured":"P. Vaidya, \u201cA locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope,\u201d Technical Report, AT&T Bell Laboratories (Murray Hill, NJ 1987)."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4613-9617-8_3","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"Y. Ye","year":"1989","unstructured":"Y. Ye, \u201cAn extension of Karmarkar's algorithm and the trust region method for quadratic programing,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior-Point and Related Methods (Springer, New York, 1989) pp. 49\u201363."},{"key":"CR27","first-page":"357","volume":"12","author":"D.B. Yudin","year":"1976","unstructured":"D.B. Yudin and A.S. Nemirovskii, \u201cInformational complexity and effective methods of solution for convex extremal problems,\u201dEkonomika i Matematicheskie Metody 12 (1976) 357\u2013369. [Translated inMatekon 13 (1977) 25\u201345.]","journal-title":"Ekonomika i Matematicheskie Metody"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585708.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585708\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:30Z","timestamp":1556897550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["BF01585708"],"URL":"https:\/\/doi.org\/10.1007\/bf01585708","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}