{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:19:39Z","timestamp":1770293979158,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12532-024-00254-y","type":"journal-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T16:03:48Z","timestamp":1717603428000},"page":"229-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nonlinear conjugate gradient for smooth convex functions"],"prefix":"10.1007","volume":"16","author":[{"given":"Sahar","family":"Karimi","sequence":"first","affiliation":[]},{"given":"Stephen A.","family":"Vavasis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,5]]},"reference":[{"key":"254_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, New Delhi (2017)"},{"key":"254_CR2","unstructured":"Bubeck, S., Lee, Y.T., Singh, M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent (2015). arXiv:1506.08187"},{"key":"254_CR3","unstructured":"Buhler, C.K., Benson, H., Shanno, D.: Regularized step directions in conjugate gradient minimization for machine learning (2021). ArXiv preprint arXiv:2110.06308"},{"key":"254_CR4","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Convex until proven guilty: dimension-free acceleration of gradient descent on non-convex functions. In: Proceedings of 2017 International Conference on Machine Learning (2017)"},{"issue":"2","key":"254_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/0709024","volume":"9","author":"A Cohen","year":"1972","unstructured":"Cohen, A.: Rate of convergence of several conjugate gradient algorithms. SIAM J. Numer. Anal. 9(2), 248\u2013259 (1972)","journal-title":"SIAM J. Numer. Anal."},{"key":"254_CR6","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1007\/BF02871976","volume":"41","author":"Y Dai","year":"1998","unstructured":"Dai, Y., Yuan, Y.: Convergence properties of Beale-Powell restart algorithms. Sci. China Ser. A 41, 1142\u20131150 (1998)","journal-title":"Sci. China Ser. A"},{"key":"254_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y Dai","year":"2001","unstructured":"Dai, Y., Yuan, Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103, 33\u201347 (2001)","journal-title":"Ann. Oper. Res."},{"key":"254_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H., Kou, C.X.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23, 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"254_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1137\/0704002","volume":"4","author":"JW Daniel","year":"1967","unstructured":"Daniel, J.W.: The conjugate gradient method for linear and nonlinear operator equations. SIAM J. Numer. Anal. 4(1), 10\u201326 (1967)","journal-title":"SIAM J. Numer. Anal."},{"key":"254_CR10","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"2","key":"254_CR11","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N Gould","year":"1999","unstructured":"Gould, N., Lucidi, S., Roma, M., Toint, P.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999). https:\/\/doi.org\/10.1137\/S1052623497322735","journal-title":"SIAM J. Optim."},{"key":"254_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W Hager","year":"2005","unstructured":"Hager, W., Zhang, H.: 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":"254_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"5","key":"254_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1214\/aos\/1176342503","volume":"1","author":"PJ Huber","year":"1973","unstructured":"Huber, P.J.: Robust regression: asymptotics, conjectures, and Monte Carlo. Ann. Stat. 1(5), 799\u2013821 (1973)","journal-title":"Ann. Stat."},{"key":"254_CR15","unstructured":"Karimi, S.: On the relationship between conjugate gradient and optimal first-order methods for convex optimization. Ph.D. thesis, University of Waterloo (2014)"},{"key":"254_CR16","unstructured":"Karimi, S., Vavasis, S.: A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent (2017). arXiv:1712.09498"},{"issue":"5","key":"254_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/BF00933041","volume":"13","author":"GP McCormick","year":"1974","unstructured":"McCormick, G.P., Ritter, K.: Alternative proofs of the convergence properties of the conjugate-gradient method. J. Optim. Theory Appl. 13(5), 497\u2013518 (1974)","journal-title":"J. Optim. Theory Appl."},{"key":"254_CR18","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. John Wiley and Sons, Chichester (1983). Translated by E. R. Dawson from Slozhnost\u2019 Zadach i Effektivnost\u2019 Metodov Optimizatsii, (1979), Glavnaya redaktsiya fiziko-matematicheskoi literatury, Izdatelstva \u201cNauka\u201d"},{"issue":"3","key":"254_CR19","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Doklady AN SSSR 269(3), 543\u2013547 (1983). (translated as Soviet Math. Dokl)","journal-title":"Doklady AN SSSR"},{"key":"254_CR20","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer, Philadelphia (2003)"},{"key":"254_CR21","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"3","key":"254_CR22","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"254_CR23","unstructured":"Paquette, C., Vavasis, S.: Potential-based analyses of first-order methods for constrained and composite optimization (2019). arXiv:1903.08497"},{"key":"254_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12, 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"4","key":"254_CR25","doi-asserted-by":"publisher","first-page":"3170","DOI":"10.1137\/18M1232772","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., O\u2019Donoghue, B., Boyd, S.: Globally convergent type-I Anderson acceleration for nonsmooth fixed-point iterations. SIAM J. Optim. 30(4), 3170\u20133197 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00254-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-024-00254-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00254-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T16:19:34Z","timestamp":1720628374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-024-00254-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["254"],"URL":"https:\/\/doi.org\/10.1007\/s12532-024-00254-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"6 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}