{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T09:13:46Z","timestamp":1781169226180,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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,8]]},"DOI":"10.1007\/bf01580903","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:58:11Z","timestamp":1114664291000},"page":"285-300","source":"Crossref","is-referenced-by-count":100,"title":["On affine scaling algorithms for nonconvex quadratic programming"],"prefix":"10.1007","volume":"56","author":[{"given":"Yinyu","family":"Ye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"\u201cPolynomial barrier function algorithms for convex quadratic programming,\u201d Report J 88-5","author":"M. Ben Daya","year":"1988","unstructured":"M. Ben Daya and C.M. Shetty, \u201cPolynomial barrier function algorithms for convex quadratic programming,\u201d Report J 88-5, School of ISE, Georgia Institute of Technology (Atlanta, GA, 1988)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"4","author":"L. Csanky","year":"1976","unstructured":"L. Csanky, \u201cFast parallel matrix inversion algorithms,\u201dSIAM Journal on Computing 4 (1976) 618\u2013623.","journal-title":"SIAM Journal on Computing"},{"key":"CR3","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematical Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematical Doklady"},{"key":"CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1968","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability, A Guide to the Theory of NP-completeness (Freeman, New York, 1968)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"D.M. Gay, \u201cComputing optimal locally constrained steps,\u201dSIAM Journal on Scientific and Statistical Computing 2 (1981) 186\u2013197.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1990\/91","unstructured":"D. Goldfarb and S. Liu, \u201cAn O(n 3 L) primal interior point algorithm for convex quadratic programming,\u201dMathematical Programming 49 (1990\/91) 325\u2013340.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/1909768","volume":"34","author":"S.M. Goldfeld","year":"1966","unstructured":"S.M. Goldfeld, R.E. Quandt and H.F. Trotter, \u201cMaximization by quadratic hill climbing,\u201dEconometrica 34 (1966) 541\u2013551.","journal-title":"Econometrica"},{"key":"CR8","volume-title":"Large scale concave quadratic minimization and extensions","author":"B. Kalantari","year":"1984","unstructured":"B. Kalantari and J.B. Rosen, \u201cLarge scale concave quadratic minimization and extensions,\u201d Ph.D. Thesis, Computer Science Department, University of Minnesota (Minneapolis, MN, 1984)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"S. Kapoor and P. Vaidya, \u201cFast algorithms for Convex quadratic programming and multicommodity flows,\u201dProceedings of the 18th Annual ACM Symposium on Theory Computing (1986) 147\u2013159.","DOI":"10.1145\/12130.12145"},{"key":"CR10","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":"CR11","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":"CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0024-3795(87)90060-7","volume":"91","author":"T.Y. Li","year":"1987","unstructured":"T.Y. Li and T. Sauer, \u201cHomotopy methods for generalized eigenvalue problems,\u201dLinear Algebra Applications 91 (1987) 65\u201374.","journal-title":"Linear Algebra Applications"},{"key":"CR13","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 Mathematics of Operations Research 15 (1990) 342\u2013363.","journal-title":"Mathematics of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Alder, \u201cAn O(n 3 L) primal\u2014dual interior point algorithm for convex quadratic programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR15","volume-title":"Numerical Analysis","author":"J.J. Mor\u00e9","year":"1977","unstructured":"J.J. Mor\u00e9, \u201cThe Levenberg-Marquardt algorithm: implementation and theory,\u201d in G.A. Watson:Numerical Analysis (Springer, New York, 1977)."},{"key":"CR16","volume-title":"Linear and Combinatorial Programming","author":"K.G. Murty","year":"1976","unstructured":"K.G. Murty,Linear and Combinatorial Programming (Krieger Publishing Company, Malabar, 1976)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"K.G. Murty and S.N. Kabadi, \u201cSome NP-complete problems in quadratic and nonlinear programming,\u201dMathematical Programming 39 (1987) 117\u2013129.","journal-title":"Mathematical Programming"},{"key":"CR18","volume-title":"Algebraic complexity of computing polynomial zeros","author":"V. Pan","year":"1988","unstructured":"V. Pan, \u201cAlgebraic complexity of computing polynomial zeros,\u201d manuscript, Computer Science Department, SUNY at Albany (Albany, NY, 1988)."},{"key":"CR19","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, NY, 1982)."},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences 268","author":"P.M. Pardalos","year":"1987","unstructured":"P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences 268 (Springer, Berlin, 1987)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm based on Newton's method for linear programming,\u201dMathematical Programming 40 (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR22","unstructured":"J. Renegar, private communication (1989)."},{"key":"CR23","unstructured":"G. Sonnevend, \u201cAn \u2018analytic center\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201dProceedings 12th IFIP Conference on System Modeling and Optimization (Budapest, 1985)."},{"key":"CR24","doi-asserted-by":"crossref","DOI":"10.2172\/6836252","volume-title":"\u201cNewton's method with a model trust region modification,\u201d Report ANL-80-106","author":"D.C. Sorensen","year":"1980","unstructured":"D.C. Sorensen, \u201cNewton's method with a model trust region modification,\u201d Report ANL-80-106, Argonne National Laboratory (Argonne, IL, 1980)."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd and Y. Ye, \u201cA centered projective algorithm for linear programming,\u201dMathematics of Operations Research 15 (1990) 508\u2013529.","journal-title":"Mathematics of Operations Research"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon and B.A. Freedman, \u201cOn a modification of Karmarkar's linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"CR27","volume-title":"Interior algorithms for linear, quadratic, and linearly constrained convex programming","author":"Y. Ye","year":"1987","unstructured":"Y. Ye, \u201cInterior algorithms for linear, quadratic, and linearly constrained convex programming,\u201d Ph.D. Thesis, Department of Engineering-Economic Systems, Stanford University (Stanford, CA, 1987)."},{"key":"CR28","volume-title":"Progress in Mathematical Programming","author":"Y. Ye","year":"1989","unstructured":"Y. Ye, \u201cAn extension of Karmarkar's algorithm and the trust region method for quadratic programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1989)."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","volume":"44","author":"Y. Ye","year":"1989","unstructured":"Y. Ye and E. Tse, \u201cAn extension of Karmarkar's projective algorithm for convex quadratic programming,\u201dMathematical Programming 44 (1989) 157\u2013179.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580903.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580903\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:12Z","timestamp":1556881932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580903"],"URL":"https:\/\/doi.org\/10.1007\/bf01580903","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}