{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T08:01:56Z","timestamp":1721721716730},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T00:00:00Z","timestamp":1153180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s00211-006-0021-6","type":"journal-article","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T08:16:13Z","timestamp":1153124173000},"page":"241-269","source":"Crossref","is-referenced-by-count":34,"title":["A subspace implementation of quasi-Newton trust region methods for unconstrained optimization"],"prefix":"10.1007","volume":"104","author":[{"given":"Zhou-Hong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ya-Xiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"Bongartz I., Conn A.R., Gould N.I.M., Toint Ph.L.(1995): CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123\u2013160","journal-title":"ACM Trans. Math. Softw."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01580735","volume":"40","author":"R. Byrd","year":"1988","unstructured":"Byrd R., Schnabel R.B., Shultz G.A.(1988): Approximation solution of the trust region problem by minimization over two-dimensional subspaces. Math. Prog. 40, 247\u2013263","journal-title":"Math. Prog."},{"key":"21_CR3","unstructured":"Conn A.R., Gould N.I.M., Sartenaer A., Toint Ph.L.(1996): On the iterated-subspace minimization methods for nonlinear optimization with a combination of general equality and constraints. In: Adams L., Nazareth J.L. (eds). Proceedings on Linear and Nonlinear Conjugate Gradient-Related Methods, pp. 50\u201378. SIAM"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","volume":"50","author":"A.R. Conn","year":"1988","unstructured":"Conn A.R., Gould N.I.M., Toint Ph.L.(1988): Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comput. 50, 399\u2013430","journal-title":"Math. Comput."},{"key":"21_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A.R. Conn","year":"2000","unstructured":"Conn A.R., Gould N.I.M., Toint Ph.L.(2000): Trust-Region Methods. SIAM Publications, Philadelphia, Pennsylvania"},{"key":"21_CR6","first-page":"772","volume":"30","author":"W. Daniel","year":"1976","unstructured":"Daniel W., Gragg W.B., Kaufman L., Stewart G.W.(1976): Reorthogonalization and stable algorithms for updating the Gram\u2013Schmidt QR factorization. Math. Comput. 30, 772\u2013795","journal-title":"Math. Comput."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF00932218","volume":"28","author":"J.E. Dennis","year":"1979","unstructured":"Dennis J.E., Mei H.H.W.(1979): Two new unconstrained optimization algorithms which use function and gradient values. J. Optim. Appl. 28, 453\u2013482","journal-title":"J. Optim. Appl."},{"key":"21_CR8","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1983","unstructured":"Dennis J.E., Schnabel R.B.(1983): Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J.J.(2002): Benchmarking optimization software with performance profiles. Math. Prog. 91, 201\u2013213","journal-title":"Math. Prog."},{"key":"21_CR10","volume-title":"Practical Methods of Optimization, 2nd edn","author":"R. Fletcher","year":"1987","unstructured":"Fletcher R.(1987): Practical Methods of Optimization, 2nd edn. Wiley, New York"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"Gay D.M.(1981): Computing optimal locally constrained steps. SIAM J. Sci. Stat. Comput. 2, 186\u2013197","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/S1052623400307950","volume":"12","author":"P.E. Gill","year":"2001","unstructured":"Gill P.E., Leonard M.W.(2001) : Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 12, 209\u2013237","journal-title":"SIAM J. Optim."},{"key":"21_CR13","volume-title":"Matrix Computations, 3rd edn","author":"G.H. Golub","year":"1996","unstructured":"Golub G.H., Van Loan C.F.(1996): Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould N.I.M., Orban D., Toint Ph.L.(2003): CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394","journal-title":"ACM Trans. Math. Softw."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. Liu","year":"1989","unstructured":"Liu D.C., Nocedal J.(1989): On the limited memory BFGS method for large scale optimization. Math. Prog. 45, 503\u2013528","journal-title":"Math. Prog."},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9 J.J., Sorensen D.C.(1983): Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"21_CR17","first-page":"153","volume-title":"Advances in Nonlinear Programming, Proceedings of the 1996 International Conference on Nonlinear Programming.","author":"J. Nocedal","year":"1998","unstructured":"Nocedal J., Yuan Y.(1998): Combining trust region and line search techniques. In: Yuan Y. (eds). Advances in Nonlinear Programming, Proceedings of the 1996 International Conference on Nonlinear Programming. Kluwer, Dordrecht, pp. 153\u2013176"},{"key":"21_CR18","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":"Powell M.J.D. (1970): A new algorithm for unconstrained optimization. In: Rosen J.B., Mangasarian O.L., Ritter K.(eds). Nonlinear Programming. Academic, New York, pp. 31\u201366"},{"key":"21_CR19","first-page":"87","volume-title":"Numerical Methods for Nonlinear Algebraic Equations.","author":"M.J.D. Powell","year":"1970","unstructured":"Powell M.J.D.(1970): A hybrid method for nonlinear equations. In: Robinowitz P. (eds). Numerical Methods for Nonlinear Algebraic Equations. Gordon and Breach Science, London, pp. 87\u2013144"},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/B978-0-12-468650-2.50005-5","volume-title":"Nonlinear Programming, 2.","author":"M.J.D. Powell","year":"1975","unstructured":"Powell M.J.D.(1975): Convergence properties of a class of minimization algorithms. In: Mangasarian O.L., Meyer R.R., Robinson S.M. (eds). Nonlinear Programming, 2. Academic, New York, pp. 1\u201327"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02591998","volume":"29","author":"M.J.D. Powell","year":"1984","unstructured":"Powell M.J.D.(1984): On the global convergence of trust region algorithms for unconstrained minimization. Math. Prog. 29, 297\u2013303","journal-title":"Math. Prog."},{"key":"21_CR22","unstructured":"Siegel, D.: Implementing and modifying Broyden class updates for large scale optimization. Report DAMPT 1992\/NA12, University of Cambridge, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, England (1992)"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01581137","volume":"66","author":"D. Siegel","year":"1994","unstructured":"Siegel D.(1994): Modifying the BFGS update by a new column scaling technique. Math. Prog. 66, 45\u201378","journal-title":"Math. Prog."},{"key":"21_CR24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"D.C. Sorensen","year":"1982","unstructured":"Sorensen D.C.(1982): Newton\u2019s method with a model trust region modifications. SIAM J. Numer. Anal. 19, 409\u2013426","journal-title":"SIAM J. Numer. Anal."},{"key":"21_CR25","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T. Steihaug","year":"1983","unstructured":"Steihaug T.(1983): The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637","journal-title":"SIAM J. Numer. Anal."},{"key":"21_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971408","volume-title":"Matrix Algorithms. Volume 1: Basic Decompostions","author":"G.W. Stewart","year":"1998","unstructured":"Stewart G.W.(1998): Matrix Algorithms. Volume 1: Basic Decompostions. SIAM, Philadelphia, PA"},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/zamm.19950751207","volume":"75","author":"J. Stoer","year":"1995","unstructured":"Stoer J., Yuan Y.(1995): A subspace study on conjugate gradient algorithms. ZAMM Z. Angew. Math. Mech. 75, 69\u201377","journal-title":"ZAMM Z. Angew. Math. Mech."},{"key":"21_CR28","unstructured":"Vl $$\\tilde{c}$$ ek, J., Luk $$\\tilde{s}$$ an, L.: New variable metric methods for unconstrained minimization covering the large-scale case. Technical Report No. V876, October 2002, Institute of Computer Science, Academy of Sciences of the Czech Republic (2002)"},{"key":"21_CR29","volume-title":"Numerical Methods for Nonlinear Optimization","author":"Y. Yuan","year":"1994","unstructured":"Yuan Y.(1994): Numerical Methods for Nonlinear Optimization. Shanghai Science and Technology Press, Shanghai"},{"key":"21_CR30","first-page":"271","volume-title":"ICM99: Proceedings of the Fourth International Congress on Industrial and Applied Mathematics.","author":"Y. Yuan","year":"2000","unstructured":"Yuan Y. (2000): A review of trust region algorithms for optimization. In: Ball J.M., Hunt J.C.R. (eds). ICM99: Proceedings of the Fourth International Congress on Industrial and Applied Mathematics. Oxford University Press, Oxford, pp. 271\u2013282"},{"key":"21_CR31","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s101070050012","volume":"87","author":"Y. Yuan","year":"2000","unstructured":"Yuan Y.(2000): On the truncated conjugate gradient method. Math. Prog. 87, 561\u2013571","journal-title":"Math. Prog."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-006-0021-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-006-0021-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-006-0021-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T16:22:38Z","timestamp":1558628558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-006-0021-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,18]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["21"],"URL":"https:\/\/doi.org\/10.1007\/s00211-006-0021-6","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,18]]}}}