{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:00:07Z","timestamp":1787382007616,"version":"build-2736575974"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,2]]},"abstract":"<jats:p>In this paper we give a global convergence proof of the second-order affine scaling algorithm for convex quadratic programming problems, where the new iterate is the point which minimizes the objective function over the intersection of the feasible region with the ellipsoid centered at the current point and whose radius is a fixed fraction $\\beta \\in (0,1]$ of the radius of the largest \"scaled\" ellipsoid inscribed in the nonnegative orthant. The analysis is based on the local Karmarkar potential function introduced by Tsuchiya. For any $\\beta \\in (0, 1)$ and without assuming any nondegeneracy assumption on the problem, it is shown that the sequences of primal iterates and dual estimates converge to optimal solutions of the quadratic program and its dual, respectively.<\/jats:p>","DOI":"10.1137\/s1052623495283851","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"26-58","source":"Crossref","is-referenced-by-count":15,"title":["Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming"],"prefix":"10.1137","volume":"8","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594923"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592024"},{"key":"R3","first-page":"499","volume":"314","author":"Bayer D. A.","year":"1989","journal-title":"Trans. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9947","issn-type":"print"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1995290201951"},{"key":"R5","first-page":"747","volume":"174","author":"Dikin I.","year":"1967","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"R6","first-page":"54","volume":"12","author":"Dikin I. I.","year":"1974","journal-title":"Upravlyaemye Sistemy"},{"key":"R7","unstructured":"I. I. Dikin,\n                      The Convergence of Dual Variables\n                      , Tech. report, Siberian Energy Institute, Irkutsk, Russia, December 1991."},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022683121151"},{"key":"R9","unstructured":"I. Dikin, V. Zorkal\u2019cev, Iterativnoe reshenie zadach matematicheskogo programmirovaniya, \u201cNauka\u201d Sibirsk. Otdel., 1980, 144\u20130, Algoritmy metoda vnutrennikh tochek. [Algorithms for the method of interior points]82a:90135"},{"key":"R10","unstructured":"C. C. Gonzaga,\n                      Convergence of the Large Step Primal Affine\u2013Scaling Algorithm for Primal Nondegenerate Linear Programs\n                      , Tech. report ES\u2013230\/90, Department of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, September 1990."},{"key":"R11","unstructured":"C. C. Gonzaga and L. A. Carlos,\n                      A Primal Affine\u2013Scaling Algorithm for Linearly Constrained Convex Programs\n                      , Tech. report ES\u2013238\/90, Department of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, December 1990."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.1.97"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.4.842"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023109"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02206821"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580601"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840455"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580904"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"T. Tsuchiya,\n                      Global convergence of the affine scaling algorithm for degenerate strictly convex quadratic programming problems\n                      , talk presented at TIMS\/ORSA Joint National Meeting, Chicago, IL, May 1993.","DOI":"10.1007\/BF02023112"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582896"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.3.527"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023112"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5610(96)00025-1"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/0805027"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"R. Vanderbei, J. Lagarias, I. I. Dikin\u2019s convergence result for the affine\u2010scaling algorithm, Contemp. Math., Vol. 114, Amer. Math. Soc., Providence, RI, 1990, 109\u201311992d:90046","DOI":"10.1090\/conm\/114\/1097868"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840454"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Christoph Witzgall, Paul Boggs, Paul Domich, On the convergence behavior of trajectories for linear programming, Contemp. Math., Vol. 114, Amer. Math. Soc., Providence, RI, 1990, 161\u201318792d:90047","DOI":"10.1090\/conm\/114\/1097873"},{"key":"R29","unstructured":"Yinyu Ye, An extension of Karmarkar\u2019s algorithm and the trust region method for quadratic programming, Springer, New York, 1989, 49\u20136390b:90104"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580903"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587086"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623495283851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:00:36Z","timestamp":1787331636000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623495283851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["10.1137\/S1052623495283851"],"URL":"https:\/\/doi.org\/10.1137\/s1052623495283851","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}