{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:07:54Z","timestamp":1694624874863},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,12,3]],"date-time":"2005-12-03T00:00:00Z","timestamp":1133568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,12,3]],"date-time":"2005-12-03T00:00:00Z","timestamp":1133568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s11075-005-9008-0","type":"journal-article","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T15:15:40Z","timestamp":1133536540000},"page":"173-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On memory gradient method with trust region for unconstrained optimization"],"prefix":"10.1007","volume":"41","author":[{"given":"Zhen-Jun","family":"Shi","sequence":"first","affiliation":[]},{"given":"Jie","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,3]]},"reference":[{"key":"9008_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J. Barzilai","year":"1988) 141\u2013148.","unstructured":"J. Barzilai and J.M. Borwein, Two-point step size gradient methods, IMA J. Numer. Anal. 8 (1988) 141\u2013148.","journal-title":"IMA J. Numer. Anal."},{"key":"9008_CR2","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods (Academic, New York, 1982)."},{"key":"9008_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF00928717","volume":"4","author":"J.W. Cantrell","year":"1969","unstructured":"J.W. Cantrell, Relation between the memory gradient method and the Fletcher\u2013Reeves method, J. Optim. Theory Appl. 4 (1969) 67\u201371.","journal-title":"J. Optim. Theory Appl."},{"key":"9008_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00930579","volume":"4","author":"E.E. Cragg","year":"1969","unstructured":"E.E. Cragg and A.V. Levy, Study on a supermemory gradient method for the minimization of functions, J. Optim. Theory Appl. 4 (1969) 191\u2013205.","journal-title":"J. Optim. Theory Appl."},{"key":"9008_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/0803009","volume":"3","author":"A.R. Conn","year":"1993","unstructured":"A.R. Conn, N. Gould, A. Startenaer and P.L. Toint, Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints, SIAM J. Optim. 3 (1993) 164\u2013221.","journal-title":"SIAM J. Optim."},{"key":"9008_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/imamat\/11.3.317","volume":"11","author":"L.W.C. Dixon","year":"1973","unstructured":"L.W.C. Dixon, Conjugate directions without line searches, J. Inst. Math. Appl. 11 (1973) 317\u2013328.","journal-title":"J. Inst. Math. Appl."},{"key":"9008_CR7","unstructured":"Y.H. Dai and Y. Yuan, Nonlinear Conjugate Gradient Method (Shanghai Science and Technology, 1999)."},{"key":"9008_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A. Friedlander","year":"1999","unstructured":"A. Friedlander, J.M. Martinez, B. Molina and M. Raydan, Gradient method with retards and generalizations, SIAM J. Numer. Anal. 36 (1999) 275\u2013289.","journal-title":"SIAM J. Numer. Anal."},{"key":"9008_CR9","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/BF01385810","volume":"62","author":"L. Grippo","year":"1991","unstructured":"L. Grippo, F. Lampariello and S. Lucidi, A class of nonmonotone stability methods in unconstrained optimization, Numer. Math. 62 (1991) 779\u2013805.","journal-title":"Numer. Math."},{"key":"9008_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J.C. Gilbert","year":"1992","unstructured":"J.C. Gilbert and J. Nocedal, Global convergence properties of conjugate gradient methods for optimization, SIAM J. Optim. 2 (1992) 21\u201342.","journal-title":"SIAM J. Optim."},{"key":"9008_CR11","first-page":"375","volume":"78","author":"L. Grippo","year":"1997","unstructured":"L. Grippo and S. Lucidi, A globally convergent version of the Polak\u2013Ribi\u00e8re conjugate gradient method, Math. Program. 78 (1997) 375\u2013391.","journal-title":"Math. Program."},{"key":"9008_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00935882","volume":"11","author":"H.Y. Huang","year":"1973","unstructured":"H.Y. Huang and J.P. Chambliss, Quadratically convergent algorithms and one-dimensional search schemes, J. Optim. Theory Appl. 11 (1973) 175\u2013188.","journal-title":"J. Optim. Theory Appl."},{"key":"9008_CR13","doi-asserted-by":"crossref","unstructured":"M.R. Hestenes, Conjugate Direction Methods in Optimization (Springer Berlin Heidelberg New York, 1980).","DOI":"10.1007\/978-1-4612-6048-6"},{"key":"9008_CR14","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"R. Horst, P.M. Pardalos and A.V. Thoai, Introduction to Global Optimization (Kluwer, Dordrecht, 1995)."},{"key":"9008_CR15","volume-title":"Linear and Nonlinear Programming","author":"D.C. Luenberger","year":"1989","unstructured":"D.C. Luenberger, Linear and Nonlinear Programming, second edition (Addition Wesley, Reading, MA, 1989).","edition":"second edition"},{"key":"9008_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF00929359","volume":"3","author":"A. Miele","year":"1969","unstructured":"A. Miele and J.W. Cantrell, Study on a memory gradient method for the minimization of functions,  J. Optim. Theory Appl. 3 (1969) 459\u2013470.","journal-title":"J. Optim. Theory Appl."},{"key":"9008_CR17","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, Berlin Heidelberg New York, 1999)."},{"key":"9008_CR18","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970)."},{"key":"9008_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M. Raydan","year":"1997","unstructured":"M. Raydan, The Barzilai and Borwein gradient method for large scale unconstrained minimization problems, SIAM J. Optim. 7 (1997) 26\u201333.","journal-title":"SIAM J. Optim."},{"key":"9008_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013708715892","volume":"21","author":"M. Raydan","year":"2002","unstructured":"M. Raydan and B.F. Svaiter, Relaxed steepest descent and Cauchy\u2013Barzilai\u2013Borwein method, Comp. Optim. Appl. 21 (2002) 155\u2013167.","journal-title":"Comp. Optim. Appl."},{"key":"9008_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0307-904X(82)80007-3","volume":"6","author":"J.A. Snyman","year":"1982","unstructured":"J.A. Snyman, A new and dynamic method for unconstrained minimization, Appl. Math. Model. 6 (1982) 449\u2013462.","journal-title":"Appl. Math. Model."},{"key":"9008_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002110050305","volume":"78","author":"J. Schropp","year":"1997","unstructured":"J. Schropp, A note on minimization problems and multistep methods, Numer. Math. 78 (1997) 87\u2013101.","journal-title":"Numer. Math."},{"key":"9008_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1093\/imanum\/20.1.135","volume":"20","author":"J. Schropp","year":"2000","unstructured":"J. Schropp, One-step and multistep procedures for constrained minimization problems, IMA J. Numer. Anal. 20 (2000) 135\u2013152.","journal-title":"IMA J. Numer. Anal."},{"key":"9008_CR24","first-page":"333","volume":"23","author":"Z.J. Shi","year":"2001","unstructured":"Z.J. Shi, Modified HS conjugate gradient method and its global convergence (in Chinese), Math. Numer. Sin. 23 (2001) 333\u2013406.","journal-title":"Math. Numer. Sin."},{"key":"9008_CR25","first-page":"47","volume":"31","author":"Z.J. Shi","year":"2002","unstructured":"Z.J. Shi, Restricted PR conjugate gradient method and its convergence (in Chinese), Adv. in Math. 31 (2002) 47\u201355.","journal-title":"Adv. in Math."},{"key":"9008_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.cam.2003.10.025","volume":"170","author":"Z.J. Shi","year":"2004","unstructured":"Z.J. Shi and J. Shen, A gradient-related algorithm with inexact line searches, J. Comput. Appl. Math. 170 (2004) 349\u2013370.","journal-title":"J. Comput. Appl. Math."},{"key":"9008_CR27","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0722035","volume":"22","author":"A. Vardi","year":"1985","unstructured":"A. Vardi, A trust region algorithm for equality constrained minimization: Convergence properties and implementation, SIAM J. Numer. Anal. 22 (1985) 575\u2013591.","journal-title":"SIAM J. Numer. Anal."},{"key":"9008_CR28","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0307-904X(84)90048-9","volume":"8","author":"D.J. Van Wyk","year":"1984","unstructured":"D.J. Van Wyk, Differential optimization techniques, Appl. Math. Model. 8 (1984) 419\u2013424.","journal-title":"Appl. Math. Model."},{"key":"9008_CR29","doi-asserted-by":"crossref","unstructured":"K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, 282 (Springer, 1987).","DOI":"10.1007\/978-3-642-61582-5"},{"key":"9008_CR30","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0377-0427(99)00276-9","volume":"114","author":"M.N. Vrahatis","year":"2000","unstructured":"M.N. Vrahatis, G.S. Androulakis, J.N. Lambrinos and G.D. Magolas, A class of gradient unconstrained minimization algorithms with adaptive stepsize, J. Comput. Appl. Math. 114 (2000) 367\u2013386.","journal-title":"J. Comput. Appl. Math."},{"key":"9008_CR31","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BF00932655","volume":"18","author":"M.A. Wolfe","year":"1976","unstructured":"M.A. Wolfe and C. Viazminsky, Supermemory descent methods for unconstrained minimization, J. Optim. Theory Appl. 18 (1976) 455\u2013468.","journal-title":"J. Optim. Theory Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-9008-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-005-9008-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-9008-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-9008-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T01:09:33Z","timestamp":1652490573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-005-9008-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["9008"],"URL":"https:\/\/doi.org\/10.1007\/s11075-005-9008-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,3]]},"assertion":[{"value":"29 August 2005","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2005","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}