{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T03:26:22Z","timestamp":1773977182746,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988,1]]},"DOI":"10.1007\/bf01580735","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:54:00Z","timestamp":1114682040000},"page":"247-263","source":"Crossref","is-referenced-by-count":328,"title":["Approximate solution of the trust region problem by minimization over two-dimensional subspaces"],"prefix":"10.1007","volume":"40-40","author":[{"given":"Richard H.","family":"Byrd","sequence":"first","affiliation":[]},{"given":"Robert B.","family":"Schnabel","sequence":"additional","affiliation":[]},{"given":"Gerald A.","family":"Shultz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"71","volume-title":"Numerical Optimization 1984","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: P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds.,Numerical Optimization 1984 (SIAM, Philadelphia, 1984) pp. 71\u201382."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF00932218","volume":"28","author":"J.E. Dennis Jr.","year":"1979","unstructured":"J.E. Dennis, Jr. and H.H.W. Mei, \u201cTwo new unconstrained optimization algorithms which use function and gradient values,\u201dJournal of Optimization Theory and its Applications 28 (1979) 453\u2013482.","journal-title":"Journal of Optimization Theory and its Applications"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"D.M. Gay, \u201cComputing optimal locally constrained steps,\u201dSIAM Journal on Scientific and Statistical Computing 2 (1981) 186\u2013197.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR4","volume-title":"\u201cAn algorithm for minimization using exact second derivatives,\u201d Rept. TP515","author":"M.D. Hebden","year":"1973","unstructured":"M.D. Hebden, \u201cAn algorithm for minimization using exact second derivatives,\u201d Rept. TP515, A.E.R.E. (Harwell, England, 1973)."},{"key":"CR5","first-page":"105","volume-title":"Numerical Analysis Dundee 1977, Lecture Notes in Mathematics 630","author":"J.J. Mor\u00e9","year":"1977","unstructured":"J.J. Mor\u00e9, \u201cThe Levenberg-Marquardt algorithm: implementation and theory,\u201d in: G.A. Watson, ed.,Numerical Analysis Dundee 1977, Lecture Notes in Mathematics 630 (Springer-Verlag, Berlin, 1977) pp. 105\u2013116."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"J.J. Mor\u00e9, B.S. Garbow and K.E. Hillstrom, \u201cTesting unconstrained optimization software,\u201dACM Transactions on Mathematical Software 7 (1981) 17\u201341.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR7","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, \u201cComputing a trust region step,\u201dSIAM Journal on Scientific and Statistical Computing 4 (1983) 553\u2013572.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR8","volume-title":"The Symmetric Eigenvalue Problem","author":"B.N. Parlett","year":"1980","unstructured":"B.N. Parlett,The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, NJ, 1980)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear Programming","author":"M.J.D. Powell","year":"1970","unstructured":"M.J.D. Powell, \u201cA new algorithm for unconstrained optimization,\u201d in: J.B. Rosen, O. L. Mangasarian and K. Ritter, eds.,Nonlinear Programming (Academic Press, New York, 1970) pp. 31\u201365."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1137\/0721054","volume":"21","author":"R.B. Schnabel","year":"1984","unstructured":"R.B. Schnabel and P. Frank, \u201cTensor methods for nonlinear equations,\u201dSIAM Journal on Numerical Analysis 21 (1984) 815\u2013843.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR11","doi-asserted-by":"crossref","DOI":"10.21236\/ADA169927","volume-title":"\u201cSolving systems of nonlinear equations by tensor methods,\u201d Technical Report CU-CS-334-86","author":"R.B. Schnabel","year":"1986","unstructured":"R.B. Schnabel and P. Frank, \u201cSolving systems of nonlinear equations by tensor methods,\u201d Technical Report CU-CS-334-86, Department of Computer Science, University of Colorado at Boulder (Boulder, CO, 1986)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/6187.6192","volume":"11","author":"R.B. Schnabel","year":"1985","unstructured":"R.B. Schnabel, B.E. Weiss and J.E. Koontz, \u201cA modular system of algorithms for unconstrained minimization,\u201dACM Transactions on Mathematical Software 11 (1985) 419\u2013440.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/355826.355828","volume":"5","author":"L. Schrage","year":"1979","unstructured":"L. Schrage, \u201cA more portable Fortran random number generator,\u201dACM Transactions on Mathematical Software 5 (1979) 132\u2013138.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"G. A. Shultz","year":"1985","unstructured":"G. A. Shultz, R. B. Schnabel and R.H. Byrd, \u201cA family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties\u201c,SIAM Journal on Numerical Analysis 22 (1985) 47\u201367.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"D.C. Sorensen","year":"1982","unstructured":"D.C. Sorensen, \u201cNewton's method with a model trust region modification,\u201dSIAM Journal on Numerical Analysis 19 (1982) 409\u2013426.","journal-title":"SIAM Journal on Numerical Analysis"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580735.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580735\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:11Z","timestamp":1556896331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["BF01580735"],"URL":"https:\/\/doi.org\/10.1007\/bf01580735","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}