{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:13:00Z","timestamp":1774620780283,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T00:00:00Z","timestamp":1308096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11590-011-0355-6","type":"journal-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T16:51:10Z","timestamp":1308070270000},"page":"1643-1655","source":"Crossref","is-referenced-by-count":7,"title":["A new variant of the memory gradient method for unconstrained optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"Yue","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongping","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,15]]},"reference":[{"key":"355_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Applied Optimization","author":"P.M. Pardalos","year":"2002","unstructured":"Pardalos P.M., Resende M.G.C.: Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"355_CR2","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"2006","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization (Second Edn). Springer Series in Operations Research, Springer, New York (2006)","edition":"2"},{"key":"355_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R. Fletcher","year":"1964","unstructured":"Fletcher R., Reeves C.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"355_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"355_CR5","doi-asserted-by":"crossref","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. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"355_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y.H. Dai","year":"1999","unstructured":"Dai Y.H., Yuan Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"355_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M. Al-Baali","year":"1985","unstructured":"Al-Baali M.: Descent Property and Global Convergence of the Fletcher-Reeves Method with Inexact Line Search. IMA J. Num. Anal. 5, 121\u2013124 (1985)","journal-title":"IMA J. Num. Anal."},{"key":"355_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1093\/imanum\/16.2.155","volume":"16","author":"Y.H. Dai","year":"1996","unstructured":"Dai Y.H., Yuan Y.: Convergence properties of the Fletcher-Reeves method. IMA J. Num. Anal. 16, 155\u2013164 (1996)","journal-title":"IMA J. Num. Anal."},{"key":"355_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"M.J.D. Powell","year":"1986","unstructured":"Powell M.J.D.: Convergence properties of algorithms for nonlinear optimization. SIAM Rev. 28, 487\u2013500 (1986)","journal-title":"SIAM Rev."},{"key":"355_CR10","first-page":"375","volume":"77","author":"L. Grippo","year":"1997","unstructured":"Grippo L., Lucidi S.: A globally convergent version of the Polark-Ribi\u00e8re conjugate gradient method. Math. Prog. 77, 375\u2013391 (1997)","journal-title":"Math. Prog."},{"issue":"2","key":"355_CR11","doi-asserted-by":"crossref","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. J. Optim. Theor. Appl. 71(2), 399\u2013405 (1991)","journal-title":"J. Optim. Theor. Appl."},{"key":"355_CR12","volume-title":"Encyclopedia of Optimization","year":"2009","unstructured":"Floudas, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization. 2nd edn. Springer, Berlin (2009)","edition":"2"},{"issue":"4","key":"355_CR13","doi-asserted-by":"crossref","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. Theor. Appl. 18(4), 455\u2013468 (1976)","journal-title":"J. Optim. Theor. Appl."},{"issue":"2","key":"355_CR14","first-page":"275","volume":"20","author":"Z. Shi","year":"2003","unstructured":"Shi Z.: A new memory gradient under exact line search. Asia-Pacific J. Oper. Res. 20(2), 275\u2013284 (2003)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"2","key":"355_CR15","first-page":"99","volume":"17","author":"Z. Shi","year":"2000","unstructured":"Shi Z.: Supermemory gradient method for unconstrained optimization. J. Eng. Math. 17(2), 99\u2013104 (2000)","journal-title":"J. Eng. Math."},{"key":"355_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11075-005-9008-0","volume":"41","author":"Z. Shi","year":"2006","unstructured":"Shi Z.: On memory gradient method with trust region for unconstrained optimization. Num. Algortm. 41, 173\u2013196 (2006)","journal-title":"Num. Algortm."},{"issue":"1","key":"355_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00928717","volume":"4","author":"W. Cantrell","year":"1969","unstructured":"Cantrell W.: Relation between the memory gradient method and the Fletcher-Revees method. J. Optim. Theor. Appl. 4(1), 67\u201371 (1969)","journal-title":"J. Optim. Theor. Appl."},{"key":"355_CR18","doi-asserted-by":"crossref","unstructured":"Ou, Y., Wang, G.: A new supermemory gradient method for unconstrained optimization problems. Optim. Lett. doi: 10.1007\/s11590-011-0328-9 (2011)","DOI":"10.1007\/s11590-011-0328-9"},{"issue":"3","key":"355_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10589-006-8719-z","volume":"35","author":"Y. Narushima","year":"2006","unstructured":"Narushima Y., Yabe H.: Global convergence of a memory gradient method for unconstrained optimization. Computational Optim. Appl. 35(3), 325\u2013346 (2006)","journal-title":"Computational Optim. Appl."},{"key":"355_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9 J.J., Garbow B.S., Hillstrom K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"355_CR21","first-page":"147","volume":"10","author":"N. Andrei","year":"2008","unstructured":"Andrei N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0355-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0355-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0355-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:29Z","timestamp":1559409089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0355-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,15]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0355-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,15]]}}}