{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:04Z","timestamp":1752379804501,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":[[2003,10]]},"DOI":"10.1023\/a:1025136421370","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:25:03Z","timestamp":1063736703000},"page":"35-61","source":"Crossref","is-referenced-by-count":20,"title":["Feasible Interior Methods Using Slacks for Nonlinear Optimization"],"prefix":"10.1007","volume":"26","author":[{"given":"Richard H.","family":"Byrd","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[]},{"given":"Richard A.","family":"Waltz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5141767_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S1052623498344720","volume":"11","author":"P. Armand","year":"2000","unstructured":"P. Armand, J.-Ch. Gilbert, and S. Jan-J\u00e9gou, \u201cA feasible BFGS interior point algorithm for solving strongly convex minimization problems,\u201d SIAM Journal on Optimization, vol. 11, pp. 199-222, 2000.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5141767_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph.L. Toint, \u201cCUTE: Constrained and unconstrained testing environment,\u201d ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123-160, 1995.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"5141767_CR3","unstructured":"R.H. Byrd, Robust Trust Region Methods for Constrained Optimization, Third SIAM Conference on Optimization, Houston, Texas, May 1987."},{"issue":"1","key":"5141767_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"R.H. Byrd","year":"2000","unstructured":"R.H. Byrd, J. Ch. Gilbert, and J. Nocedal, \u201cA trust region method based on interior point techniques for nonlinear programming,\u201d Mathematical Programming, vol. 89, no. 1, pp. 149-185, 2000.","journal-title":"Mathematical Programming"},{"issue":"4","key":"5141767_CR5","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"R.H. Byrd","year":"1999","unstructured":"R.H. Byrd, M.E. Hribar, and J. Nocedal, \u201cAn interior point algorithm for large scale nonlinear programming,\u201d SIAM Journal on Optimization, vol. 9, no. 4, pp. 877-900, 1999.","journal-title":"SIAM Journal on Optimization"},{"key":"5141767_CR6","first-page":"71","volume-title":"Numerical Optimization","author":"M.R. Celis","year":"1984","unstructured":"M.R. Celis, J.E. Dennis, and R.A. Tapia, \u201cA trust region strategy for nonlinear equality constrained optimization,\u201d In Numerical Optimization 1984, P.T. Boggs, R.H. Byrd, and R.B. Schnabel (Eds.), pp. 71-82, SIAM: Philadelphia, USA, 1985."},{"issue":"2","key":"5141767_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s101070050112","volume":"87","author":"A.R. Conn","year":"2000","unstructured":"A.R. Conn, N.I.M. Gould, D. Orban, and Ph.L. Toint, \u201cA primal-dual trust-region algorithm for non-convex nonlinear programming,\u201d Mathematical Programming, vol. 87, no. 2, pp. 215-249, 2000.","journal-title":"Mathematical Programming"},{"key":"5141767_CR8","volume-title":"MPS-SIAM Series on Optimization","author":"A.R. Conn","year":"2000","unstructured":"A.R. Conn, N.I.M. Gould, and Ph. Toint, Trust-Region Methods, MPS-SIAM Series on Optimization. SIAM publications: Philadelphia, PA, USA, 2000."},{"key":"5141767_CR9","first-page":"15","volume-title":"Nonlinear Optimization and Related Topics","author":"A.R. Conn","year":"1999","unstructured":"A.R. Conn, N.I.M. Gould, and Ph.L. Toint, \u201cA primal-dual algorithm for minimizing a nonconvex function subject to bound and linear equality constraints,\u201d In Nonlinear Optimization and Related Topics, G. Di Pillo and F. Giannessi (Eds.), pp. 15-50, Kluwer Academic Publishers: Dordrecht, The Netherlands, 1999."},{"issue":"3","key":"5141767_CR10","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 Journal of Optimization Theory and Applications, vol. 89, no. 3, pp. 507-541, June 1996.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"5141767_CR11","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. J.Wiley and Sons: Chichester, England, 1968. Reprinted as Classics in Applied Mathematics 4, SIAM: Philadelphia, USA, 1990."},{"issue":"4","key":"5141767_CR12","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 Journal on Optimization, vol. 8, no. 4, pp. 1132-1152, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"5141767_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4613-3335-7_2","volume-title":"Advances in Nonlinear Programming","author":"D.M. Gay","year":"1998","unstructured":"D.M. Gay, M.L. Overton, and M.H. Wright, \u201cA primal-dual interior method for non-convex nonlinear programming,\u201d In Advances in Nonlinear Programming, Y. Yuan (Ed.), pp. 31-56, Kluwer Academic Publishers: Dordrecht, The Netherlands, 1998."},{"key":"5141767_CR14","volume-title":"AEATechnology","author":"Harwell Subroutine Library","year":"2000","unstructured":"Harwell Subroutine Library, ACatalogue of Subroutines (HSL 2000),AEATechnology, Harwell: Oxfordshire, England, 2000."},{"issue":"4","key":"5141767_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10556789608805638","volume":"6","author":"C.T. Lawrence","year":"1996","unstructured":"C.T. Lawrence and A.L. Tits, \u201cNonlinear equality constraints in feasible sequential quadratic programming,\u201d Optimization Methods and Software, vol. 6, no. 4, pp. 265-282, 1996.","journal-title":"Optimization Methods and Software"},{"key":"5141767_CR16","unstructured":"C.T. Lawrence and A.L. Tits, \u201cA computationally efficient feasible sequential quadratic programming algorithm,\u201d Technical report, Institute for Systems Research Technical Report TR 98-46, University of Maryland, College Park, 1998."},{"key":"5141767_CR17","volume-title":"Trust region algorithms for optimization with nonlinear equality and inequality constraints","author":"E.O. Omojokun","year":"1989","unstructured":"E.O. Omojokun, \u201cTrust region algorithms for optimization with nonlinear equality and inequality constraints,\u201d PhD thesis, University of Colorado, Boulder, Colorado, USA, 1989."},{"key":"5141767_CR18","first-page":"87","volume-title":"Numerical Methods for Nonlinear Algebraic Equations","author":"M.J.D. Powell","year":"1970","unstructured":"M.J.D. Powell, \u201cA hybrid method for nonlinear equations,\u201d In Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz (Ed.), pp. 87-114, Gordon and Breach: London, 1970."},{"issue":"2","key":"5141767_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"M.J.D. Powell","year":"1990","unstructured":"M.J.D. Powell and Y. Yuan, \u201cA trust region algorithm for equality constrained optimization,\u201d Mathematical Programming, vol. 49, no. 2, pp. 189-213, 1990.","journal-title":"Mathematical Programming"},{"key":"5141767_CR20","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 Computational Optimization and Applications, vol. 13, pp. 231-252, 1999.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"5141767_CR21","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0722035","volume":"22","author":"A. Vardi","year":"1985","unstructured":"A. Vardi, \u201cA trust region algorithm for equality constrained minimization: Convergence properties and implementation,\u201d SIAM Journal on Numerical Analysis, vol. 22, no. 3, pp. 575-591, 1985.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"3","key":"5141767_CR22","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02592190","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 Mathematical Programming, Series A, vol. 75, no. 3, pp. 377-397, 1996.","journal-title":"Mathematical Programming, Series A"},{"key":"5141767_CR23","volume-title":"A globally and superlinearly convergent primal-dual point trust region method for large scale constrained optimization","author":"H. Yamashita","year":"1997","unstructured":"H. Yamashita, H. Yabe, and T. Tanabe, \u201cA globally and superlinearly convergent primal-dual point trust region method for large scale constrained optimization,\u201d Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan, 1997."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025136421370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025136421370\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025136421370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:34:44Z","timestamp":1752377684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025136421370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141767"],"URL":"https:\/\/doi.org\/10.1023\/a:1025136421370","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}