{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:57:08Z","timestamp":1743019028909,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":28,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_323","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:00:04Z","timestamp":1219662004000},"page":"1822-1831","source":"Crossref","is-referenced-by-count":0,"title":["Large Scale Trust Region Problems"],"prefix":"10.1007","author":[{"given":"Laura","family":"Palagi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"323_CR1_323","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A. Ben-tal","year":"1996","unstructured":"Ben-tal A, Teboulle M (1996) Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math Program 72(1):51\u201363","journal-title":"Math. Program."},{"issue":"2","key":"323_CR2_323","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"T.F. Coleman","year":"1996","unstructured":"Coleman TF, Li Y (1996) An interior trust region approach for nonlinear minimization subject to bounds. SIAM J Optim 6(2):418\u2013445","journal-title":"SIAM J. Optim."},{"key":"323_CR3_323","volume-title":"Lanczos algorithms for large symmetric eigenvalue computation","author":"J.K. Cullum","year":"1985","unstructured":"Cullum JK, Willoughby RA (1985) Lanczos algorithms for large symmetric eigenvalue computation. Birkh\u00e4user, Basel"},{"issue":"2","key":"323_CR4_323","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"R.S. Dembo","year":"1983","unstructured":"Dembo RS, Steihaug T (1983) Truncated-Newton methods algorithms for large-scale unconstrained optimization. Math Program 26(2):190\u2013212","journal-title":"Math. Program."},{"issue":"2","key":"323_CR5_323","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"Pham DinhTao","year":"1998","unstructured":"DinhTao Pham, HoaiAn LeThi (1998) D.C. optimization algorithm for solving the trust region subproblem. SIAM J Optim 8(2):476\u2013505","journal-title":"SIAM J. Optim."},{"issue":"2","key":"323_CR6_323","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02192227","volume":"85","author":"F. Facchinei","year":"1995","unstructured":"Facchinei F, Lucidi S (1995) Quadratically and superlinear convergent algorithms for the solution of inequality constrained optimization problems. J\u00a0Optim Th Appl 85(2):265\u2013289","journal-title":"J. Optim. Th. Appl."},{"issue":"2","key":"323_CR7_323","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"Gay DM (1981) Computing optimal locally constrained steps. SIAM J Sci Statist Comput 2(2):186\u2013197","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"3","key":"323_CR8_323","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L. Grippo","year":"1989","unstructured":"Grippo L, Lampariello F, Lucidi S (1989) A\u00a0truncated Newton method with nonmonotone linesearch for unconstrained optimization. J\u00a0Optim Th Appl 60(3):401\u2013419","journal-title":"J. Optim. Th. Appl."},{"key":"323_CR9_323","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L. Grippo","year":"1991","unstructured":"Grippo L, Lampariello F, Lucidi S (1991) A\u00a0class of nonmonotone stabilization methods in unconstrained optimization. Numerische Math 59:779\u2013805","journal-title":"Numerische Math."},{"key":"323_CR10_323","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1515\/9781400862528.125","volume-title":"Recent Advances in Global Optimization","author":"A. Kamath","year":"1991","unstructured":"Kamath A, Karmarkar N (1991) A\u00a0continuous approach to compute upper bounds in quadratic maximization problems with integer constraints. In: Floudas CA, Pardalos PM (eds) Recent Advances in Global Optimization. Princeton Univ. Press, Princeton, pp 125\u2013140"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar N (1990) An interior-point approach to {NP}-complete problems. In: Proc. Math. Program. Soc. Conf. Integer Programming and Combinatorial Optimization, pp 351\u2013366","key":"323_CR11_323","DOI":"10.1090\/conm\/114\/1097880"},{"issue":"3","key":"323_CR12_323","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N. Karmarkar","year":"1991","unstructured":"Karmarkar N, Resende MGC, Ramakrishnan KG (1991) An interior point algorithm to solve computationally difficult set covering problems. Math Program 52(3):597\u2013618","journal-title":"Math. Program."},{"issue":"1","key":"323_CR13_323","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1137\/S1052623494278049","volume":"8","author":"S. Lucidi","year":"1998","unstructured":"Lucidi S, Palagi L, Roma M (1998) On some properties of quadratic programs with a\u00a0convex quadratic constraint. SIAM J Optim 8(1):105\u2013122","journal-title":"SIAM J. Optim."},{"issue":"3","key":"323_CR14_323","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01585768","volume":"68","author":"J.M. Mart\u00ednez","year":"1995","unstructured":"Mart\u00ednez JM, Santos SA (1995) Trust region algorithms on arbitrary domains. Math Program 68(3):267\u2013302","journal-title":"Math. Program."},{"unstructured":"Matlab (1995) Reference guide. MathWorks","key":"323_CR15_323"},{"issue":"3","key":"323_CR16_323","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9 JJ, Sorensen DC (1983) Computing a\u00a0trust region step. SIAM J Sci Statist Comput 4(3):553\u2013572","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"323_CR17_323","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4899-0289-4_22","volume-title":"Nonlinear Optimization and Applications","author":"P.M. Pardalos","year":"1996","unstructured":"Pardalos PM (1996) Continuous approches to discrete optimization problems. In: Di Pillo G, Giannessi F (eds) Nonlinear Optimization and Applications. Plenum, New York, pp 313\u2013328"},{"key":"323_CR18_323","first-page":"69","volume":"25","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos PM, Ye Y, Han C-G (1991) Algorithms for the solution of quadratic knapsack problems. LAA 25:69\u201391","journal-title":"LAA"},{"key":"323_CR19_323","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"M.J.D. Powell","year":"1991","unstructured":"Powell MJD, Yuan Y (1991) A\u00a0trust region algorithm for equality constrained optimization. Math Program 49:189\u2013211","journal-title":"Math. Program."},{"issue":"2","key":"323_CR20_323","first-page":"273","volume":"77","author":"F. Rendl","year":"1997","unstructured":"Rendl F, Wolkowicz H (1997) A\u00a0semidefinite framework to trust region subproblems with applications to large scale minimization. Math Program 77(2):273\u2013299","journal-title":"Math. Program."},{"issue":"2","key":"323_CR21_323","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/0805019","volume":"5","author":"A. Sartenaer","year":"1995","unstructured":"Sartenaer A (1995) A\u00a0class of trust region methods for nonlinear network optimization problems. SIAM J Optim 5(2):379\u2013407","journal-title":"SIAM J. Optim."},{"issue":"2","key":"323_CR22_323","first-page":"409","volume":"19","author":"D.C. Sorensen","year":"1982","unstructured":"Sorensen DC (1982) Newton's method with a\u00a0model trust region modification. SIAM J Sci Statist Comput 19(2):409\u2013427","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"1","key":"323_CR23_323","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/S1052623494274374","volume":"7","author":"D.C. Sorensen","year":"1997","unstructured":"Sorensen DC (1997) Minimization of a\u00a0large-scale quadratic function subject to an ellipsoidal constraint. SIAM J Optim 7(1):141\u2013161","journal-title":"SIAM J. Optim."},{"key":"323_CR24_323","volume-title":"Nonlinear optimization","author":"S.A. Vavasis","year":"1991","unstructured":"Vavasis SA (1991) Nonlinear optimization. Oxford Univ. Press, Oxford"},{"key":"323_CR25_323","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1515\/9781400862528.19","volume-title":"Recent Advances in Global Optimization","author":"Y. Ye","year":"1991","unstructured":"Ye Y (1991) A\u00a0new complexity result on minimization of a\u00a0quadratic function with a\u00a0sphere constraint. In: Floudas CA, Pardalos PM (eds) Recent Advances in Global Optimization. Princeton Univ. Press, Princeton, pp 19\u201331"},{"key":"323_CR26_323","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y. Ye","year":"1992","unstructured":"Ye Y (1992) On affine scaling algorithms for nonconvex quadratic programming. Math Program 56:285\u2013300","journal-title":"Math. Program."},{"key":"323_CR27_323","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01587086","volume":"44","author":"Y. Ye","year":"1989","unstructured":"Ye Y, Tse E (1989) An extension of Karmarkar's projective algorithm for convex quadratic programming. Math Program 44:157\u2013179","journal-title":"Math. Program."},{"key":"323_CR28_323","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01580852","volume":"47","author":"Y. Yuan","year":"1990","unstructured":"Yuan Y (1990) On a\u00a0subproblem of trust region algorithms for constrained optimization. Math Program 47:33\u201363","journal-title":"Math. Program."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:08:36Z","timestamp":1720699716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_323"}},"subtitle":["LSTR"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_323","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}