{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:57:02Z","timestamp":1725541022223},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642012150"},{"type":"electronic","value":"9783642012167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01216-7_68","type":"book-chapter","created":{"date-parts":[[2009,11,18]],"date-time":"2009-11-18T15:32:19Z","timestamp":1258558339000},"page":"641-647","source":"Crossref","is-referenced-by-count":3,"title":["A New Supermemory Gradient Method without Line Search for Unconstrained Optimization"],"prefix":"10.1007","author":[{"given":"June","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanbin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/imanum\/16.2.155","volume":"16","author":"Y.H. Dai","year":"1996","unstructured":"Dai, Y.H., Yuan, Y.X.: Convergence Properties of the Fletcher-Reeves Method. IMA J. Numer. Anal.\u00a016, 155\u2013164 (1996)","journal-title":"IMA J. Numer. Anal."},{"key":"68_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00939927","volume":"71","author":"Y.F. Hu","year":"1991","unstructured":"Hu, Y.F., Storey, C.: Global Convergence Result for Conjugate Gradient Methods. JOTA\u00a071, 399\u2013405 (1991)","journal-title":"JOTA"},{"key":"68_CR3","first-page":"375","volume":"78","author":"L. Grippo","year":"1997","unstructured":"Grippo, L., Lucidi, S.: A Globally Convergent Version of the Polak-Ribiere Conjugate Gradient Method. Math. Prog.\u00a078, 375\u2013391 (1997)","journal-title":"Math. Prog."},{"key":"68_CR4","series-title":"Unconstrained Optimization","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Unconstrained Optimization, vol.\u00a01. John Wiley Sons, New York (1987)"},{"key":"68_CR5","first-page":"552","volume":"25","author":"Y.H. Dai","year":"1996","unstructured":"Dai, Y.H., Yuan, Y.X.: Convergence Properties of the Conjugate Descent Method. Advances in Mathematics\u00a025, 552\u2013562 (1996)","journal-title":"Advances in Mathematics"},{"key":"68_CR6","unstructured":"Dai, Y.H., Yuan, Y.X.: Nonlinear Conjugate Gradient Methods. Shanghai Scientific and Technical Publishers (2000)"},{"key":"68_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y.H. Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.X.: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property. SIAM J. Optim.\u00a010, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"68_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J.C. Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global Convergence Properties of Conjugate Gradient Methods for Optimization. SIAM J. Optim.\u00a02, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BF00932655","volume":"18","author":"M.A. Wolfe","year":"1976","unstructured":"Wolfe, M.A., Viazminsky, C.: Supermemory Descent Methods for Unconstrained Minimization. J. Optim. Theory Appl.\u00a018, 455\u2013468 (1976)","journal-title":"J. Optim. Theory Appl."},{"key":"68_CR10","first-page":"99","volume":"17","author":"S. Zhenjun","year":"2000","unstructured":"Zhenjun, S.: Supermemory Gradient Method for Unconstrained Optimization. J. Eng. Math.\u00a017, 99\u2013104 (2000)","journal-title":"J. Eng. Math."},{"key":"68_CR11","first-page":"275","volume":"20","author":"S. Zhenjun","year":"2003","unstructured":"Zhenjun, S.: A New Memory Gradient under Exact Line Search. Asia-Pacific J. Oper. Res.\u00a020, 275\u2013284 (2003)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"68_CR12","first-page":"265","volume":"35","author":"S. Zhenjun","year":"2006","unstructured":"Zhenjun, S.: A New Supermemory Gradient Method for Unconstrained Optimization. Advances in Mathematics\u00a035, 265\u2013274 (2006)","journal-title":"Advances in Mathematics"},{"key":"68_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1012903105391","volume":"103","author":"J. Sun","year":"2001","unstructured":"Sun, J., Zhang, J.: Global Convergence of Conjugate Gradient Methods without Line Search. Annals of Operations Research\u00a0103, 161\u2013173 (2001)","journal-title":"Annals of Operations Research"},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0377-0427(02)00416-8","volume":"146","author":"X. Chen","year":"2002","unstructured":"Chen, X., Sun, J.: Global Convergence of a Two-parameter Family of Conjugate Gradient Methods without Line Search. Journal of Computational and Applied Mathematics\u00a0146, 37\u201345 (2002)","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"68_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0217595905000716","volume":"22","author":"X. Li","year":"2005","unstructured":"Li, X., Chen, X.: Global Convergence of Shortest-residual Family of Conjugate Gradient Methods without Line Search. Asia-Pacific Journal of Operational Research\u00a022, 529\u2013538 (2005)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"68_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.55937\/sut\/1173205671","volume":"42","author":"Y. Narushima","year":"2006","unstructured":"Narushima, Y.: A Memory Gradient Method without Line Search for Unconstrained Optimization. SUT Journal of Mathematics\u00a042, 191\u2013206 (2006)","journal-title":"SUT Journal of Mathematics"},{"key":"68_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s12190-007-0021-4","volume":"26","author":"Z.S. Yu","year":"2008","unstructured":"Yu, Z.S.: Global Convergence of a Memory Gradient Method without Line Search. J. Appl. Math. Comput.\u00a026, 545\u2013553 (2008)","journal-title":"J. Appl. Math. Comput."},{"key":"68_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00935546","volume":"33","author":"A.I. Cohen","year":"1981","unstructured":"Cohen, A.I.: Stepsize Analysis for Descent Methods. J. Optim. Theory Appl.\u00a033, 187\u2013205 (1981)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Advances in Soft Computing","The Sixth International Symposium on Neural Networks (ISNN 2009)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01216-7_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T12:04:45Z","timestamp":1685189085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01216-7_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642012150","9783642012167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01216-7_68","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2009]]}}}