{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:29:59Z","timestamp":1781332199583,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,11,25]],"date-time":"2005-11-25T00:00:00Z","timestamp":1132876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,25]],"date-time":"2005-11-25T00:00:00Z","timestamp":1132876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10107-004-0560-5","type":"journal-article","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T19:19:19Z","timestamp":1132859959000},"page":"391-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":859,"title":["An interior algorithm for nonlinear optimization that combines line search and trust region steps"],"prefix":"10.1007","volume":"107","author":[{"given":"R.A.","family":"Waltz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.L.","family":"Morales","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Nocedal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.","family":"Orban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,25]]},"reference":[{"key":"560_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, E.D., Gondzio, J., M\u00e9sz\u00e1ros, C., Xu, X.: Implementation of interior point methods for large scale linear programming. In: T. Terlaky, (ed.), Interior Point Methods in Mathematical Programming, Dordrecht, The Netherlands, 1996. Kluwer Academic Publishers, pp. 189\u2013252","DOI":"10.1007\/978-1-4613-3449-1_6"},{"key":"560_CR2","unstructured":"Betts, J., Eldersveld, S.K., Frank, P.D., Lewis, J.G.: An interior-point nonlinear programming algorithm for large scale optimization. Technical report MCT TECH-003, Mathematics and Computing Technology, The Boeing Company, P.O. Box 3707, Seattle WA 98124-2207, 2000"},{"key":"560_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"Bongartz","year":"1","unstructured":"Bongartz, I., Conn, A.R., Gould, N.I.M.,Toint, Ph.L.: CUTE: Constrained and Unconstrained Testing Environment. ACM Transactions on Mathematical Software 21 (1), 123\u2013160 (1995)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"560_CR4","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/0708060","volume":"8","author":"Bunch","year":"4","unstructured":"Bunch, J.R., Parlett, B.N.: Direct methods for solving symmetric indefinite systems of linear equations. SIAM Journal on Numerical Analysis 8 (4), 639\u2013655 (1971)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"560_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"Byrd","year":"1","unstructured":"Byrd, R.H., Gilbert, J.-Ch., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming 89 (1), 149\u2013185 (2000)","journal-title":"Mathematical Programming"},{"key":"560_CR6","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"Byrd","year":"4","unstructured":"Byrd, R.H., Hribar, M.E., Nocedal, J.: An interior point algorithm for large scale nonlinear programming. SIAM J. Optimization 9 (4), 877\u2013900 (1999)","journal-title":"SIAM J. Optimization"},{"key":"560_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-003-0376-8","volume":"99","author":"Byrd","year":"2004","unstructured":"Byrd, R.H., Marazzi, M., Nocedal, J.: On the convergence of Newton iterations to non-stationary points. Mathematical Programming, Series A 99, 127\u2013148 (2004)","journal-title":"Mathematical Programming, Series A"},{"key":"560_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01588794","volume":"49","author":"Byrd","year":"3","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.: Representations of quasi-newton matrices and their use in limited memory methods. Mathematical Programming 49 (3), 285\u2013323 (1991)","journal-title":"Mathematical Programming"},{"key":"560_CR9","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.: Trust-region methods. MPS-SIAM Series on Optimization. SIAM publications, Philadelphia, Pennsylvania, USA, 2000","DOI":"10.1137\/1.9780898719857"},{"key":"560_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming, Series A 91, 201\u2013213 (2002)","journal-title":"Mathematical Programming, Series A"},{"key":"560_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/0732012","volume":"32","author":"Dussault","year":"1","unstructured":"Dussault, J.-P.: Numerical stability and efficiency of penalty algorithms. SIAM J. Numerical Anal. 32 (1), 296\u2013317 (1995)","journal-title":"SIAM J. Numerical Anal."},{"key":"560_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"El-Bakry","year":"3","unstructured":"El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optimization Theory and Appl. 89 (3), 507\u2013541, June (1996)","journal-title":"J. Optimization Theory and Appl."},{"key":"560_CR13","unstructured":"El-Hallabi, M.: A hybrid algorithm for nonlinear equality constrained optimization problems: global and local convergence theory. Technical Report TR4-99, Mathematics and Computer Science Department, Institut National des Postes et T\u00e9l\u00e9communications, Rabat, Morocco, 1999"},{"key":"560_CR14","unstructured":"Fletcher, R.: Practical Methods of Optimization. J. Wiley and Sons, Chichester, England, second edition, 1987"},{"key":"560_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Mathematical Programming 91, 239\u2013269 (2002)","journal-title":"Mathematical Programming"},{"key":"560_CR16","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/S1052623496305560","volume":"8","author":"Forsgren","year":"4","unstructured":"Forsgren, A., Gill, P.E.: Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optimization 8 (4), 1132\u20131152 (1998)","journal-title":"SIAM J. Optimization"},{"key":"560_CR17","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1137\/S1052623400370515","volume":"11","author":"Gould","year":"4","unstructured":"Gould, N.I.M., Orban, D., Sartenaer, A., Toint, Ph.L.: Superlinear convergence of primal-dual interior-point algorithms for nonlinear programming. SIAM J. Optimization 11 (4), 974\u20131002 (2001)","journal-title":"SIAM J. Optimization"},{"key":"560_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"Gould","year":"4","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr and sifdec: A Constrained and Unconstrained Testing Environment, revisited. ACM Trans. Math. Softw. 29 (4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"560_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"Gould","year":"4","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: GALAHAD, a library of thread-safe fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29 (4), 353\u2013372 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"560_CR20","unstructured":"Harwell Subroutine Library. A catalogue of subroutines (HSL 2002). AEA Technology, Harwell, Oxfordshire, England, 2002"},{"key":"560_CR21","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research. Springer, 1999","DOI":"10.1007\/b98874"},{"key":"560_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s101070100230","volume":"91","author":"Potra","year":"1","unstructured":"Potra, F.: Q-superlinear convergence of the iterates in primal-dual interior-point methods. Mathematical Programming B 91 (1), 99\u2013116 (2001)","journal-title":"Mathematical Programming B"},{"key":"560_CR23","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"Steihaug","year":"3","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numerical Anal. 20 (3), 626\u2013637 (1983)","journal-title":"SIAM J. Numerical Anal."},{"key":"560_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"Tits","year":"1","unstructured":"Tits, A.L., W\u00e4chter, A., Bakhtiari, S., Urban, T.J., Lawrence, C.T.: A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties. SIAM J. Optimization 14 (1), 173\u2013199 (2003)","journal-title":"SIAM J. Optimization"},{"key":"560_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior point algorithm for nonconvex nonlinear programming. Comput. Optimization Appl. 13, 231\u2013252 (1999)","journal-title":"Comput. Optimization Appl."},{"key":"560_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00011386","volume":"88","author":"W\u00e4chter","year":"3","unstructured":"W\u00e4chter, A., Biegler, L.T.: Failure of global convergence for a class of interior point methods for nonlinear programming. Mathematical Programming 88 (3), 565\u2013574 (2000)","journal-title":"Mathematical Programming"},{"key":"560_CR27","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Technical Report RC 23149, IBM T.J. Watson Research Center, Yorktown Heights, NY, March 2004"},{"key":"560_CR28","unstructured":"Waltz, R.A., Nocedal, J.: KNITRO user's manual. Technical Report OTC 2003\/05, Optimization Technology Center, Northwestern University, Evanston, IL, USA, April 2003"},{"key":"560_CR29","first-page":"415","volume":"40","author":"Yabe","year":"3","unstructured":"Yabe, H., Yamashita, H.: Q-superlinear convergence of primal-dual interior point quasi-Newton methods for constrained optimization. J. Oper. Res. Soc. Japan 40 (3), 415\u2013436 (1997)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"560_CR30","unstructured":"Yamashita, H.: A globally convergent primal-dual interior-point method for constrained optimization. Technical report, Mathematical System Institute, Inc., Tokyo, Japan, May 1992, Revised March 1994"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0560-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-004-0560-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0560-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0560-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T01:52:00Z","timestamp":1652493120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-004-0560-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,25]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["560"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0560-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,25]]},"assertion":[{"value":"8 August 2003","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2004","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}