{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T14:05:52Z","timestamp":1655906752798},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1007\/bf01581170","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:38:16Z","timestamp":1114666696000},"page":"283-313","source":"Crossref","is-referenced-by-count":3,"title":["Trust region affine scaling algorithms for linearly constrained convex and concave programs"],"prefix":"10.1007","volume":"80","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanhui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, An implementation of Karmarkar's algorithm for linear programming,Mathematical Programming 44 (1989) 297\u2013335. Errata in:Mathematical Programming 50 (1991) 415.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01594923","volume":"50","author":"I. Adler","year":"1991","unstructured":"I. Adler and R.D.C. Monteiro, Limiting behavior of the affine scaling continuous trajectories for linear programming problems,Mathematical Programming 50 (1991) 29\u201351.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems,Mathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR4","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming, Part I: Affine and projective scaling trajectories,Transactions of the American Mathematical Society 314 (1989) 499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR5","first-page":"195","volume":"29","author":"J. Bonnans","year":"1995","unstructured":"J. Bonnans and M. Bouhtou, The trust region affine interior point algorithm for convex and nonconvex quadratic programming,RAIRO - Recherche Op\u00e9rationnelle 29 (1995) 195\u2013217.","journal-title":"RAIRO - Recherche Op\u00e9rationnelle"},{"key":"CR6","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, Iterative solution of problems of linear and quadratic programming,Doklady Akademii Nauk SSSR 174 (1967) 747\u2013748. Translated in:Soviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR7","first-page":"54","volume":"12","author":"I.I. Dikin","year":"1974","unstructured":"I.I. Dikin, On the convergence of an iterative process,Upravlyaemye Sistemi 12 (1974) 54\u201360. (In Russian.)","journal-title":"Upravlyaemye Sistemi"},{"key":"CR8","volume-title":"The convergence of dual variables, Technical Report","author":"I.I. Dikin","year":"1991","unstructured":"I.I. Dikin, The convergence of dual variables, Technical Report, Siberian Energy Institute, Irkutsk, Russia, December 1991."},{"key":"CR9","volume-title":"Iterative solutions of mathematical programming problems","author":"I.I. Dikin","year":"1980","unstructured":"I.I. Dikin and V.I. Zorkaltsev,Iterative solutions of mathematical programming problems (Nauka, Novosibirsk, 1980)."},{"key":"CR10","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization (John Wiley, New York, 2nd ed., 1987).","edition":"2nd ed."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"D.M. Gay, Computing optimal locally constrained steps,SIAM Journal on Scientific and Statistical Computing 2 (1981) 186\u2013197.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR12","volume-title":"Convergence of the large step primal affine\u2014scaling algorithm for primal nondegenerate linear programs, Technical Report ES-230\/90","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, Convergence of the large step primal affine\u2014scaling algorithm for primal nondegenerate linear programs, Technical Report ES-230\/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, September 1990."},{"key":"CR13","first-page":"55","volume":"19","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, An interior trust region method for linearly constrained optimization,COAL Newsletter 19 (1991) 55\u201366.","journal-title":"COAL Newsletter"},{"key":"CR14","volume-title":"A primal affine\u2014scaling algorithm for linearly constrained convex programs, Technical Report ES-238\/90","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga and L.A. Carlos, A primal affine\u2014scaling algorithm for linearly constrained convex programs, Technical Report ES-238\/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, December 1990."},{"key":"CR15","first-page":"474","volume":"3","author":"C.-G. Han","year":"1992","unstructured":"C.-G. Han, P. Pardalos and Y. Ye, On the solution of indefinite quadratic problems using an interior-point algorithm,Informatica 3 (1992) 474\u2013496.","journal-title":"Informatica"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01581082","volume":"57","author":"A.P. Kamath","year":"1992","unstructured":"A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, A continuous approach to inductive inference,Mathematical Programming 57 (1992) 215\u2013238.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, A new polynomial\u2014time algorithm for linear programming,Combinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N.K. Karmarkar","year":"1991","unstructured":"N.K. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems,Mathematical Programming 52 (1991) 597\u2013618.","journal-title":"Mathematical Programming"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K. Levenberg","year":"1944","unstructured":"K. Levenberg, A method for the solution of certain nonlinear problems in least squares,Quart. Appl. Math. 2 (1944) 164\u2013168.","journal-title":"Quart. Appl. Math."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"D.W. Marquardt","year":"1963","unstructured":"D.W. Marquardt, An algorithm for least squares estimation of nonlinear parameters,SIAM Journal on Applied Mathematics 11 (1963) 431\u2013441.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/S1052623493258404","volume":"7","author":"W.F. Mascarenhas","year":"1997","unstructured":"W.F. Mascarenhas, The affine scaling algorithm fails for\u03bb = 0.999, technical report,SIAM Journal on Optimization 7 (1997) 34\u201346.","journal-title":"SIAM Journal on Optimization"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.14.1.97","volume":"14","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo and M. Shub, Boundary behavior of interior point algorithms in linear programming,Mathematics of Operations Research 14 (1989) 97\u2013114.","journal-title":"Mathematics of Operations Research"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","volume":"6","author":"C.L. Monma","year":"1987","unstructured":"C.L. Monma and A.J. Morton, Computational experience with the dual affine variant of Karmarkar's method for linear programming,Operations Research Letters 6 (1987) 261\u2013267.","journal-title":"Operations Research Letters"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/moor.16.4.842","volume":"16","author":"R.D.C. Monteiro","year":"1991","unstructured":"R.D.C. Monteiro, Convergence and boundary behavior of the projective scaling trajectories for linear programming,Mathematics of Operations Research 16 (1991) 842\u2013858.","journal-title":"Mathematics of Operations Research"},{"key":"CR25","volume-title":"Global convergence of the affine scaling algorithm for convex quadratic programming, Technical Report","author":"R.D.C. Monteiro","year":"1995","unstructured":"R.D.C. Monteiro and T. Tsuchiya, Global convergence of the affine scaling algorithm for convex quadratic programming, Technical Report, School of Industrial Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, March 1995. To appear inSIAM Journal on Optimization."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"47","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro, T. Tsuchiya and Y. Wang, A simplified global convergence proof of the affine scaling algorithm,Annals of Operations Research 47 (1993) 443\u2013482.","journal-title":"Annals of Operations Research"},{"key":"CR27","first-page":"311","volume":"69","author":"R.D.C. Monteiro","year":"1995","unstructured":"R.D.C. Monteiro and S. Wright, Superlinear primal-dual affine scaling algorithms for LCP,Mathematical Programming 69 (1995) 311\u2013333.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"J.J. Mor\u00e9, The Levenberg-Marquardt algorithm: Implementation and theory, in:Proceedings of the Dundee Conference of Numerical Analysis, G.A. Watson, ed. (Springer-Verlag, 1978).","DOI":"10.1007\/BFb0067700"},{"key":"CR29","unstructured":"J.J. Mor\u00e9, Notes on optimization software, in:Nonlinear Optimization 1981, M.J.D. Powell, ed. (Academic Press, 1982)."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"J.J. Mor\u00e9, Recent developments in algorithms and software for trust region methods, in:Mathematical Programming Bonn 1982 - The State of the Art, M.G.A. Bachem and B. Korte, eds. (Springer-Verlag, 1983) 259\u2013287.","DOI":"10.1007\/978-3-642-68874-4_11"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"J.J. Mor\u00e9 and D.C. Sorensen, Computing a trust region step,SIAM Journal of Scientific and Statistical Computing 4 (1983) 553\u2013572.","journal-title":"SIAM Journal of Scientific and Statistical Computing"},{"key":"CR32","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos and M.G.C. Resende, Interior point methods for global optimization, in:Interior point methods in mathematical programming, T. Terlaky, ed. (Kluwer Academic Publishers, 1996) 467\u2013500.","DOI":"10.1007\/978-1-4613-3449-1_12"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"G.A. Schultz","year":"1985","unstructured":"G.A. Schultz, R.S. Schnabel and R.H. Byrd, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties,SIAM Journal on Numerical Analysis 22 (1985) 47\u201367.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR34","unstructured":"D.C. Sorensen, Trust region methods for unconstrained optimization, in:Nonlinear Optimization 1981, M.J.D. Powell, ed. (Academic Press, 1982)."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01580601","volume":"60","author":"J. Sun","year":"1993","unstructured":"J. Sun, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions,Mathematical Programming 60 (1993) 69\u201379.","journal-title":"Mathematical Programming"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02206823","volume":"62","author":"J. Sun","year":"1996","unstructured":"J. Sun, A convergence proof for a convex version of Dikin's algorithm,Annals of Operations Research 62 (1996) 357\u2013374.","journal-title":"Annals of Operations Research"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01580904","volume":"56","author":"P. Tseng","year":"1992","unstructured":"P. Tseng and Z.Q. Luo, On the convergence of the affine\u2014scaling algorithm,Mathematical Programming 56 (1992) 301\u2013319.","journal-title":"Mathematical Programming"},{"key":"CR38","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01582896","volume":"52","author":"T. Tsuchiya","year":"1991","unstructured":"T. Tsuchiya, Global convergence of the affine\u2014scaling methods for degenerate linear programming problems,Mathematical Programming 52 (1991) 377\u2013404.","journal-title":"Mathematical Programming"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.17.3.527","volume":"17","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya, Global convergence property of the affine scaling method for primal degenerate linear programming problems,Mathematics of Operations Research 17 (1992) 527\u2013557.","journal-title":"Mathematics of Operations Research"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BF02023112","volume":"47","author":"T. Tsuchiya","year":"1993","unstructured":"T. Tsuchiya, Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems,Annals of Operations Research 47 (1993) 509\u2013539.","journal-title":"Annals of Operations Research"},{"key":"CR41","first-page":"77","volume":"75","author":"T. Tsuchiya","year":"1996","unstructured":"T. Tsuchiya and R.D.C. Monteiro, Superlinear convergence of the affine scaling algorithm,Mathematical Programming 75 (1996) 77\u2013110.","journal-title":"Mathematical Programming"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"T. Tsuchiya","year":"1995","unstructured":"T. Tsuchiya and M. Muramatsu, Global convergence of a long\u2014step affine scaling algorithm for degenerate linear programming problems,SIAM Journal on Optimization 5 (1995) 525\u2013551.","journal-title":"SIAM Journal on Optimization"},{"key":"CR43","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/114\/1097868","volume-title":"Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei and J.C. Lagarias, I. I. Dikin's convergence result for the affine\u2014scaling algorithm, in:Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988, J.C. Lagarias and M.J. Todd, eds., Vol. 114 of Contemporary Mathematics (American Mathematical Society, Providence, RI, 1990) 109\u2013119."},{"key":"CR44","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, A modification of Karmarkar's linear programming algorithm,Algorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"CR45","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1090\/conm\/114\/1097873","volume-title":"Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988","author":"C. Witzgall","year":"1990","unstructured":"C. Witzgall, P.T. Boggs and P.D. Domich, On the convergence behavior of trajectories for linear programming, in:Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988, J.C. Lagarias and M.J. Todd, eds., vol. 114 of Contemporary Mathematics (American Mathematical Society, Providence, RI, 1990) 161\u2013187."},{"key":"CR46","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, An extension of Karmarkar's projective algorithm and the trust region method for quadratic programming, in:Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed. (Springer, Berlin, 1989) 49\u201363."},{"key":"CR47","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, On an affine scaling algorithm for nonconvex quadratic programming,Mathematical Programming 56 (1992) 285\u2013300.","journal-title":"Mathematical Programming"},{"key":"CR48","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","volume":"44","author":"Y. Ye","year":"1989","unstructured":"Y. Ye and E. Tse, An extension of Karmarkar's projective algorithm for convex quadratic programming,Mathematical Programming 44 (1989) 157\u2013180.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581170.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581170\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:15Z","timestamp":1556881935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["BF01581170"],"URL":"https:\/\/doi.org\/10.1007\/bf01581170","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}