{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T10:01:24Z","timestamp":1708596084970},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0865-8","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T07:55:30Z","timestamp":1425023730000},"page":"119-136","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient adaptive scaling parameter for the spectral conjugate gradient method"],"prefix":"10.1007","volume":"10","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Bin","family":"Dan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"key":"865_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10589-007-9055-7","volume":"38","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38, 401\u2013416 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"865_CR2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/10556788.2013.833199","volume":"29","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S., Reza, G.: A descent family of Dai-Liao conjugate gradient methods. Optim. Methods Softw. 29, 583\u2013591 (2014)","journal-title":"Optim. Methods Softw."},{"key":"865_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two point step size gradient method. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"865_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"key":"865_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"865_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Progr. 91(2), 201\u2013213 (2002)","journal-title":"Math. Progr."},{"issue":"4","key":"865_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: CUTEr: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"865_CR8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.C.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"865_CR9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"865_CR10","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A Perry","year":"1978","unstructured":"Perry, A.: A modified conjugate gradient algorithm. Oper. Res. 26, 1073\u20131078 (1978)","journal-title":"Oper. Res."},{"key":"865_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures of the conjugate gradient method. Math. Program. 12, 241\u2013254 (1977)","journal-title":"Math. Program."},{"key":"865_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"865_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/355666.355673","volume":"2","author":"DF Shanno","year":"1976","unstructured":"Shanno, D.F., Phua, K.H.: Minimization of unconstrained multivariate functions. ACM Trans. Math. Softw. 2, 87\u201394 (1976)","journal-title":"ACM Trans. Math. Softw."},{"key":"865_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/10556780701661344","volume":"23","author":"GH Yu","year":"2008","unstructured":"Yu, G.H., Guan, L.T., Chen, W.F.: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization. Optim. Methods Softw. 23, 275\u2013293 (2008)","journal-title":"Optim. Methods Softw."},{"key":"865_CR15","unstructured":"Zoutendijk, G.: Nonlinear programming, computational Methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37\u201386. North-Holland, Amsterdam (1970)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0865-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0865-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0865-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:41Z","timestamp":1559409101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0865-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["865"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0865-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,28]]}}}