{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:04:53Z","timestamp":1751947493068,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["Numerical Algorithms"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1026130310913","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T22:50:32Z","timestamp":1067899832000},"page":"85-102","source":"Crossref","is-referenced-by-count":4,"title":["Gauss Quadrature Applied to Trust Region Computations"],"prefix":"10.1007","volume":"34","author":[{"given":"Daniela","family":"Calvetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Reichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5144016_CR1","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1023\/A:1022383005969","volume":"39","author":"D. Calvetti","year":"1999","unstructured":"D. Calvetti, G.H. Golub and L. Reichel, Estimation of the L-curve via Lanczos bidiagonalization, BIT 39 (1999) 603\u2013619.","journal-title":"BIT"},{"key":"5144016_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"A.R. Conn","year":"2000","unstructured":"A.R. Conn, N.I.M. Gould and P.L. Toint, Trust Region Methods (SIAM, Philadelphia, PA, 2000)."},{"key":"5144016_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstraint Optimization","author":"J.E. Dennis","year":"1996","unstructured":"J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstraint Optimization (SIAM, Philadelphia, PA, 1996)."},{"key":"5144016_CR4","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 J. Sci. Statist. Comput. 2 (1981) 186\u2013197.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"5144016_CR5","first-page":"105","volume-title":"Numerical Analysis 1993","author":"G.H. Golub","year":"1994","unstructured":"G.H. Golub and G. Meurant, Matrices, moments and quadrature, in: Numerical Analysis 1993, eds. D.F. Griffiths and G.A. Watson (Longman, Essex, 1994) pp. 105\u2013156."},{"key":"5144016_CR6","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. (John Hopkins Univ. Press, Baltimore, MD, 1996).","edition":"3rd ed."},{"key":"5144016_CR7","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF01385796","volume":"59","author":"G.H. Golub","year":"1991","unstructured":"G.H. Golub and U. von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math. 59 (1991) 561\u2013580.","journal-title":"Numer. Math."},{"key":"5144016_CR8","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N.I.M. Gould","year":"1999","unstructured":"N.I.M. Gould, S. Lucidi, M. Roma and P.L. Toint, Solving the trust-region subproblem using the Lanczos method, SIAM J. Optim. 9 (1999) 504\u2013525.","journal-title":"SIAM J. Optim."},{"key":"5144016_CR9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/S1052623499356071","volume":"12","author":"W.W. Hager","year":"2001","unstructured":"W.W. Hager, Minimizing a quadratic over a sphere, SIAM J. Optim. 12 (2001) 188\u2013208.","journal-title":"SIAM J. Optim."},{"key":"5144016_CR10","unstructured":"M. Hanke, A note on Tikhonov regularization of large linear problems, BIT, to appear."},{"key":"5144016_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative Methods for Optimization","author":"C.T. Kelley","year":"1999","unstructured":"C.T. Kelley, Iterative Methods for Optimization (SIAM, Philadelphia, PA, 1999)."},{"key":"5144016_CR12","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-68874-4_11","volume-title":"Mathematical Programming: The State of the Art","author":"J.J. Mor\u00e9","year":"1983","unstructured":"J.J. Mor\u00e9, Recent developments in algorithms and software for trust region methods, in: Mathematical Programming: The State of the Art, eds. A. Bachem, M. Gr\u00f6tschel and B. Korte (Springer, Berlin, 1983) pp. 258\u2013287."},{"key":"5144016_CR13","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 J. Sci. Statist. Comput. 4 (1983) 553\u2013572.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"5144016_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"J. Nocedal and S.J. Wright, Numerical Optimization (Springer, New York, 1999)."},{"key":"5144016_CR15","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M. Rojas","year":"2000","unstructured":"M. Rojas, S.A. Santos and D.C. Sorensen, A new matrix-free algorithm for the large-scale trust-region subproblem, SIAM J. Optim. 11 (2000) 611\u2013646.","journal-title":"SIAM J. Optim."},{"key":"5144016_CR16","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"D.C. Sorensen","year":"1982","unstructured":"D.C. Sorensen, Newton's method with a model trust region modification, SIAM J. Numer. Anal. 19 (1982) 409\u2013426.","journal-title":"SIAM J. Numer. Anal."},{"key":"5144016_CR17","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T. Steihaug","year":"1983","unstructured":"T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal. 20 (1983) 626\u2013637.","journal-title":"SIAM J. Numer. Anal."},{"key":"5144016_CR18","first-page":"57","volume-title":"Sparse Matrices and Their Uses","author":"P.L. Toint","year":"1981","unstructured":"P.L. Toint, Towards an efficient sparsity exploiting Newton method for minimization, in: Sparse Matrices and Their Uses, ed. I.S. Duff (Academic Press, London, 1981) pp. 57\u201388."},{"key":"5144016_CR19","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s101070050012","volume":"87","author":"Y. Yuan","year":"2000","unstructured":"Y. Yuan, On the truncated conjugate gradient method, Math. Programing Ser. A 87 (2000) 561\u2013573.","journal-title":"Math. Programing Ser. A"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026130310913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026130310913\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026130310913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:18:37Z","timestamp":1751872717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026130310913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5144016"],"URL":"https:\/\/doi.org\/10.1023\/a:1026130310913","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}