{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:29:25Z","timestamp":1752460165011,"version":"3.41.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1008774924658","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"23-35","source":"Crossref","is-referenced-by-count":8,"title":["Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming"],"prefix":"10.1007","volume":"17","author":[{"given":"L.N.","family":"Vicente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"272480_CR1","unstructured":"M. Argaez and R.A. Tapia, \u201cOn the global convergence of a modified augmented Lagrangian linesearch interior point Newton method for nonlinear programming,\u201d Technical Report TR95-38, Department of Computational and Applied Mathematics, Rice University, 1995. Revised Sept. 1999."},{"key":"272480_CR2","volume-title":"Optimal Control of Partial Differential Equations","author":"A. Battermann","year":"1996","unstructured":"A. Battermann and M. Heinkenschloss, \u201cPreconditioners for Karush-Kuhn-Tucker systems arising in the optimal control of distributed systems,\u201d in Optimal Control of Partial Differential Equations, W. Desch, F. Kappel, and K. Kunisch (Eds.) Birkh\u00e4user Verlag: Basel, 1996."},{"key":"272480_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1064827595289108","volume":"21","author":"M.A. Branch","year":"1999","unstructured":"M.A. Branch, T.F. Coleman, and Y. Li, \u201cA subspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems,\u201d SIAM J. Sci. Comput., vol. 21, pp. 1-23, 1999.","journal-title":"SIAM J. Sci. Comput."},{"key":"272480_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1093\/imamat\/12.3.223","volume":"12","author":"C.G. Broyden","year":"1973","unstructured":"C.G. Broyden, J.E. Dennis, and J.J. Mor\u00e9, \u201cOn the local and superlinear convergence of quasi-Newton methods,\u201d J. Inst. Math. Appl., vol. 12, pp. 223-245, 1973.","journal-title":"J. Inst. Math. Appl."},{"key":"272480_CR5","unstructured":"R.H. Byrd, G. Liu, and J. Nocedal, \u201cOn the local behavior of an interior point method for nonlinear programming,\u201d Numerical analysis 1997 (Dundee) Pitman Res. Notes Math. Sec., 380, pp. 37-56, Longman, 1998."},{"key":"272480_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"T.F. Coleman","year":"1994","unstructured":"T.F. Coleman and Y. Li, \u201cOn the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds,\u201d Math. Programming, vol. 67, pp. 189-224, 1994.","journal-title":"Math. Programming"},{"key":"272480_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011369","volume":"88","author":"T.F. Coleman","year":"2000","unstructured":"T.F. Coleman and Y. Li, \u201cA trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints,\u201d Math. Programming, vol. 88, pp. 1-31, 2000.","journal-title":"Math. Programming"},{"key":"272480_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s101070050112","volume":"87","author":"A.R. Conn","year":"2000","unstructured":"A.R. Conn, N. Gould, D. Orban, and Ph.L. Toint, \u201cA primal-dual trust-region algorithm for non-convex nonlinear programming,\u201d Math. Programming, vol. 87, pp. 215-249, 2000.","journal-title":"Math. Programming"},{"key":"272480_CR9","unstructured":"I. Das, \u201cAn interior point algorithm for the general nonlinear programming problem with trust region globalization,\u201d Technical Report TR96-17, Department of Computational and Applied Mathematics, Rice University, 1996."},{"key":"272480_CR10","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1137\/S036012995279031","volume":"36","author":"J.E. Dennis","year":"1998","unstructured":"J.E. Dennis, M. Heinkenschloss, and L.N. Vicente, \u201cTrust-region interior-point SQP algorithms for a class of nonlinear programming problems,\u201d SIAM J. Control Optim., vol. 36, pp. 1750-1794, 1998.","journal-title":"SIAM J. Control Optim."},{"key":"272480_CR11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"J.E. Dennis","year":"1974","unstructured":"J.E. Dennis and J.J. Mor\u00e9, \u201cA characterization of superlinear convergence and its application to quasi-Newton methods,\u201d Math. Comput., vol. 28, pp. 549-560, 1974.","journal-title":"Math. Comput."},{"key":"272480_CR12","doi-asserted-by":"crossref","unstructured":"J.E. Dennis and L.N. Vicente, \u201cTrust-region interior-point algorithms for minimization problems with simple bounds,\u201d in Applied Mathematics and Parallel Computing, Festschrift for Klaus Ritter, H. Fisher, B. Riedm\u00fcller, and S. Sch\u00e4ffler (Eds.), Physica-Verlag, Springer-Verlag, 1996, pp. 97-107.","DOI":"10.1007\/978-3-642-99789-1_7"},{"key":"272480_CR13","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201d Soviet Math. Dok., vol. 8, pp. 674-675, 1967.","journal-title":"Soviet Math. Dok."},{"key":"272480_CR14","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"A.S. El-Bakry","year":"1996","unstructured":"A.S. El-Bakry, R.A. Tapia, T. Tsuchiya, and Y. Zhang, \u201cOn the formulation and theory of the Newton interiorpoint method for nonlinear programming,\u201d J. Optim. Theory Appl., vol. 89, pp. 507-541, 1996.","journal-title":"J. Optim. Theory Appl."},{"key":"272480_CR15","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1137\/S1052623496305560","volume":"8","author":"A. Forsgren","year":"1998","unstructured":"A. Forsgren and P.E. Gill, \u201cPrimal-dual interior methods for nonconvex nonlinear programming,\u201d SIAM J. Optim., vol. 8, pp. 1132-1152, 1998.","journal-title":"SIAM J. Optim."},{"key":"272480_CR16","doi-asserted-by":"crossref","unstructured":"D.M. Gay, M.L. Overton, and M.H. Wright, \u201cA primal-dual interior method for nonconvex nonlinear programming,\u201d Proceedings of the 1996 International Conference on Nonlinear Programming, Beijing, China, pp. 31-56, Y. Yuan (Ed.), Kluwer, 1998.","DOI":"10.1007\/978-1-4613-3335-7_2"},{"key":"272480_CR17","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s101070050107","volume":"86","author":"M. Heinkenschloss","year":"1999","unstructured":"M. Heinkenschloss, M. Ulbrich, and S. Ulbrich, \u201cSuperlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption,\u201d Math. Programming, vol. 86, pp. 615-635, 1999.","journal-title":"Math. Programming"},{"key":"272480_CR18","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"2","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201d Combinatorica, vol. 2, pp. 373-395, 1984.","journal-title":"Combinatorica"},{"key":"272480_CR19","doi-asserted-by":"crossref","unstructured":"F. Leibfritz and E.W. Sachs, \u201cNumerical solution of parabolic state constrained control problems using SQP and interior-point-methods,\u201d in Large Scale Optimization: State of the Art, W.W. Hager, D. Hearn, and P. Pardalos (Eds.), Kluwer, 1994, pp. 251-264.","DOI":"10.1007\/978-1-4613-3632-7_13"},{"key":"272480_CR20","unstructured":"Y. Li, \u201cA trust region and affine scaling method for nonlinearly constrained minimization,\u201d Technical Report CTC94TR198, Advanced Computing Research Institute, Cornell University, 1994."},{"key":"272480_CR21","first-page":"1","volume":"1","author":"H.J. Martinez","year":"1995","unstructured":"H.J. Martinez, Z. Parada, and R.A. Tapia, \u201cOn the characterization of q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming,\u201d Boletin de la Sociedad Matematica Mexicana, vol. 1, pp. 1-12, 1995.","journal-title":"Boletin de la Sociedad Matematica Mexicana"},{"key":"272480_CR22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1287\/moor.14.2.203","volume":"14","author":"G.P. McCormick","year":"1989","unstructured":"G.P. McCormick, \u201cThe projective SUMT method for convex programming,\u201d Math. Oper. Res., vol. 14, pp. 203-223, 1989.","journal-title":"Math. Oper. Res."},{"key":"272480_CR23","series-title":"Tech. Rep. TR92-29","volume-title":"The Dikin-Karmarkar principle for steepest descent","author":"C.M. Samuelson","year":"1992","unstructured":"C.M. Samuelson, \u201cThe Dikin-Karmarkar principle for steepest descent,\u201d PhD Thesis, Department of Computational and Applied Mathematics, Rice University, Houston, Texas 77251, USA, Tech. Rep. TR92-29, 1992."},{"key":"272480_CR24","unstructured":"M. Ulbrich and S. Ulbrich, \u201cSuperlinear convergence of affine-scaling interior-point Newton methods for infinite-dimensional nonlinear problems with pointwise bounds,\u201d to appear in SIAM J. Control Optim."},{"key":"272480_CR25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei and D.F. Shanno, \u201cAn interior-point algorithm for nonconvex nonlinear programming,\u201d Comput. Optim. and Appl., vol, 13, pp. 231-252, 1999.","journal-title":"Comput. Optim. and Appl."},{"key":"272480_CR26","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1080\/10556789808805679","volume":"8","author":"L.N. Vicente","year":"1998","unstructured":"L.N. Vicente, \u201cOn interior-point Newton algorithms for discretized optimal control problems with state constraints,\u201d Optim. Methods Softw., vol. 8, pp. 249-275, 1998.","journal-title":"Optim. Methods Softw."},{"key":"272480_CR27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00940784","volume":"77","author":"S.J. Wright","year":"1993","unstructured":"S.J. Wright, \u201cInterior point methods for optimal control of discrete-time systems,\u201d J. Optim. Theory Appl., vol. 77, pp. 161-187, 1993.","journal-title":"J. Optim. Theory Appl."},{"key":"272480_CR28","series-title":"Technical report","volume-title":"A globally convergent primal-dual interior-point method for constrained optimization","author":"H. Yamashita","year":"1992","unstructured":"H. Yamashita, \u201cA globally convergent primal-dual interior-point method for constrained optimization,\u201d Technical report, Mathematical Systems Institute, Japan, 1992."},{"key":"272480_CR29","first-page":"377","volume":"75","author":"H. Yamashita","year":"1996","unstructured":"H. Yamashita and H. Yabe, \u201cSuperlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization,\u201d Math. Programming, vol. 75, pp. 377-397, 1996.","journal-title":"Math. Programming"},{"key":"272480_CR30","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0802015","volume":"2","author":"Y. Zhang","year":"1992","unstructured":"Y. Zhang, R.A. Tapia, and J.E. Dennis, \u201cOn the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms,\u201d SIAM J. Optim., vol. 2, pp. 304-324, 1992.","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008774924658.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008774924658\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008774924658.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:13:06Z","timestamp":1752376386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008774924658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["272480"],"URL":"https:\/\/doi.org\/10.1023\/a:1008774924658","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}