{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:31:13Z","timestamp":1768710673211,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10589-022-00372-0","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T10:02:59Z","timestamp":1651485779000},"page":"329-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On initial point selection of the steepest descent algorithm for general quadratic functions"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6552-0010","authenticated-orcid":false,"given":"Masoud","family":"Fatemi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,2]]},"reference":[{"issue":"1","key":"372_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01831719","volume":"11","author":"H Akaike","year":"1959","unstructured":"Akaike, H.: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Stat. Math. 11(1), 1\u201316 (1959)","journal-title":"Ann. Inst. Stat. Math."},{"issue":"1","key":"372_CR2","doi-asserted-by":"publisher","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 methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"372_CR3","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods. Encyclopedia of Optimization 2 (2009)","DOI":"10.1007\/978-0-387-74759-0_629"},{"key":"372_CR4","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Stochastic gradient descent tricks. In: Neural networks: tricks of the trade, pp. 421\u2013436. Springer: Berlin (2012)","DOI":"10.1007\/978-3-642-35289-8_25"},{"key":"372_CR5","unstructured":"Boyd, S., Xiao, L., Mutapcic, A.: Subgradient methods. Lecture notes of EE392o, Stanford University, Autumn Quarter 2004, 2004\u20132005 (2003)"},{"issue":"2","key":"372_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s40305-013-0007-x","volume":"1","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H.: A new analysis on the Barzilai\u2013Borwein gradient method. J. Oper. Res. Soc. China 1(2), 187\u2013198 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"372_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"YH Dai","year":"2019","unstructured":"Dai, Y.H., Huang, Y., Liu, X.W.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74(1), 43\u201365 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"372_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22(1), 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"372_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10589-014-9669-5","volume":"59","author":"R De Asmundis","year":"2014","unstructured":"De Asmundis, R., Di Serafino, D., Hager, W.W., Toraldo, G., Zhang, H.: An efficient gradient method using the yuan steplength. Comput. Optim. Appl. 59(3), 541\u2013563 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"372_CR10","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1093\/imanum\/drs056","volume":"33","author":"R De Asmundis","year":"2013","unstructured":"De Asmundis, R., di Serafino, D., Riccio, F., Toraldo, G.: On spectral properties of steepest descent methods. IMA J. Numer. Anal. 33(4), 1416\u20131435 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"372_CR11","unstructured":"Du, S.S., Jin, C., Lee, J.D., Jordan, M.I., Singh, A., Poczos, B.: Gradient descent can take exponential time to escape saddle points. In: Advances in neural information processing systems, pp. 1067\u20131077 (2017)"},{"issue":"1","key":"372_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02165472","volume":"11","author":"GE Forsythe","year":"1968","unstructured":"Forsythe, G.E.: On the asymptotic directions of the-dimensional optimum gradient method. Numer. Math. 11(1), 57\u201376 (1968)","journal-title":"Numer. Math."},{"issue":"1\u20132","key":"372_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-016-0984-8","volume":"160","author":"CC Gonzaga","year":"2016","unstructured":"Gonzaga, C.C.: On the worst case performance of the steepest descent algorithm for quadratic functions. Math. Program. 160(1\u20132), 307\u2013320 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"372_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10589-015-9775-z","volume":"63","author":"CC Gonzaga","year":"2016","unstructured":"Gonzaga, C.C., Schneider, R.M.: On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63(2), 523\u2013542 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"372_CR15","unstructured":"Higham, N.J.: The test matrix toolbox for Matlab (version 3.0). Numerical Analysis Report 276, Manchester Centre for Computational Mathematics, Manchester. http:\/\/www.maths.manchester.ac.uk\/~higham\/papers\/high95m.pdf (1995)"},{"key":"372_CR16","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W., Zhang, H.: On the asymptotic convergence and acceleration of gradient methods. arXiv:1908.07111 (2019)"},{"key":"372_CR17","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W., Zhang, H.: Gradient methods exploiting spectral properties. Optim. Methods Softw. pp. 1\u201325 (2020)"},{"issue":"1\u20132","key":"372_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","volume":"176","author":"JD Lee","year":"2019","unstructured":"Lee, J.D., Panageas, I., Piliouras, G., Simchowitz, M., Jordan, M.I., Recht, B.: First-order methods almost always avoid strict saddle points. Math. Program. 176(1\u20132), 311\u2013337 (2019)","journal-title":"Math. Program."},{"key":"372_CR19","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Berlin (2013)"},{"key":"372_CR20","unstructured":"Nguyen, T.H., Simsekli, U., Gurbuzbalaban, M., Richard, G.: First exit time analysis of stochastic gradient descent under heavy-tailed gradient noise. In: Advances in Neural Information Processing Systems, pp. 273\u2013283 (2019)"},{"issue":"1","key":"372_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1014897230089","volume":"22","author":"J Nocedal","year":"2002","unstructured":"Nocedal, J., Sartenaer, A., Zhu, C.: On the behavior of the gradient norm in the steepest descent method. Comput. Optim. Appl. 22(1), 5\u201335 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"372_CR22","unstructured":"Panageas, I., Piliouras, G.: Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions. arXiv:1605.00405 (2016)"},{"issue":"1","key":"372_CR23","doi-asserted-by":"publisher","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(1), 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"372_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013708715892","volume":"21","author":"M Raydan","year":"2002","unstructured":"Raydan, M., Svaiter, B.F.: Relaxed steepest descent and Cauchy-Barzilai-Borwein method. Comput. Optim. Appl. 21(2), 155\u2013167 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"372_CR25","doi-asserted-by":"publisher","first-page":"53040","DOI":"10.1109\/ACCESS.2019.2912200","volume":"7","author":"A Shrestha","year":"2019","unstructured":"Shrestha, A., Mahmood, A.: Review of deep learning algorithms and architectures. IEEE Access 7, 53040\u201353065 (2019)","journal-title":"IEEE Access"},{"key":"372_CR26","unstructured":"Sun, C., Liu, J.P.: New stepsizes for the gradient method. Optim. Lett. pp. 1\u201313 (2019)"},{"key":"372_CR27","unstructured":"Xu, Y., Jin, R., Yang, T.: First-order stochastic algorithms for escaping from saddle points in almost linear time. In: Advances in Neural Information Processing Systems, pp. 5530\u20135540 (2018)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00372-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00372-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00372-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T05:29:18Z","timestamp":1675488558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00372-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["372"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00372-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,2]]},"assertion":[{"value":"13 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}