{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T06:46:39Z","timestamp":1775025999938,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T00:00:00Z","timestamp":1440547200000},"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,8]]},"DOI":"10.1007\/s11590-015-0936-x","type":"journal-article","created":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T15:09:25Z","timestamp":1440515365000},"page":"1361-1370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the global convergence rate of the gradient descent method for functions with H\u00f6lder continuous gradients"],"prefix":"10.1007","volume":"10","author":[{"given":"Maryam","family":"Yashtini","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,26]]},"reference":[{"key":"936_CR1","doi-asserted-by":"publisher","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. (2015). doi: 10.1007\/s10107-015-0871-8","DOI":"10.1007\/s10107-015-0871-8"},{"key":"936_CR2","first-page":"147","volume":"3","author":"AA Goldstein","year":"1965","unstructured":"Goldstein, A.A.: On steepest descent. SIAM J. Control 3, 147\u2013151 (1965)","journal-title":"SIAM J. Control"},{"issue":"4","key":"936_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1175\/1520-0469(1994)051<0473:ALMFAL>2.0.CO;2","volume":"51","author":"WJ Koshak","year":"1994","unstructured":"Koshak, W.J., Krider, E.P.: A linear method for analyzing lightning field changes. J. Atmos. Sci. 51(4), 473\u2013488 (1994)","journal-title":"J. Atmos. Sci."},{"key":"936_CR4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133, 365\u2013397 (2012)","journal-title":"Math. Program."},{"key":"936_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10898-004-5700-1","volume":"31","author":"LZ Liao","year":"2005","unstructured":"Liao, L.Z., Qi, L., Tam, H.W.: A gradient-based continuous method for large-scale optimization problems. J. Glob. Optim. 31, 271\u2013286 (2005)","journal-title":"J. Glob. Optim."},{"key":"936_CR6","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. CORE Discussion Papers 2007\/76, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2007). http:\/\/ideas.repec.org\/p\/cor\/louvco\/2007076.html"},{"key":"936_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152, 381\u2013404 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"936_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"936_CR9","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":"936_CR10","doi-asserted-by":"crossref","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\u2013Barzilai\u2013Borwein method. Comput. Optim. Appl. 21, 155\u2013167 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"936_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3934\/naco.2012.2.395","volume":"2","author":"R Tavakoli","year":"2012","unstructured":"Tavakoli, R., Zhang, H.: A nonmonotone spectral projected gradient method for large-scale topology optimization. Numer. Algebra Control Optim. 2, 395\u2013412 (2012)","journal-title":"Numer. Algebra Control Optim."},{"key":"936_CR12","unstructured":"Zhang, Y.: Interior-point gradient methods with diagonal-scalings for simple-bound constrained optimization. Technical Report TR04-06, Department of Computational and Applied Mathematics, Rice University, Houston, Texas (2004)"},{"issue":"1","key":"936_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"936_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10589-012-9519-2","volume":"54","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Hager, W.W., Yashtini, M., Ye, X., Zhang, H.: Bregman operator splitting with variable stepsize for total variation image reconstruction. Comput. Optim. Appl. 54, 317\u2013342 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"936_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s40305-015-0078-y","volume":"3","author":"WW Hager","year":"2015","unstructured":"Hager, W.W., Ngo, C., Yashtini, M., Zhang, H.: Alternating direction approximate Newton method for partially parallel imaging. J. Oper. Res. Soc. China 3(2), 139\u2013162 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"key":"936_CR16","unstructured":"Hager, W.W., Yashtini, M., Zhang, H.: An O(1\/K) convergence rate for the BOSVS algorithm in total variation regularized least squares problems. Technical Report, Georgia Institute of Technology, School of mathematics (2015)"},{"key":"936_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9215-4","author":"P Tseng","year":"2008","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. (2008). doi: 10.1007\/s10589-008-9215-4","journal-title":"Comput. Optim. Appl."},{"key":"936_CR18","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 methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"936_CR19","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course. In: Applied Optimization. Kluwer Academic Publishers, Boston (2004). http:\/\/opac.inria.fr\/record=b1104789","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"936_CR20","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"936_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for gradient method. IMA J. Numer. Anal. 13, 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"936_CR22","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10589-014-9669-5","volume":"59","author":"R Asmundis De","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, 541\u2013563 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"936_CR23","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"WW Hager","year":"2013","unstructured":"Hager, W.W., Zhang, H.: The limited memory conjugate gradient method. SIAM J. Optim. 23, 2150\u20132168 (2013)","journal-title":"SIAM J. Optim."},{"key":"936_CR24","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.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":"936_CR25","doi-asserted-by":"crossref","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."},{"key":"936_CR26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"936_CR27","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang, L., Zhou, W., Li, D.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22(4), 697\u2013711 (2007)","journal-title":"Optim. Methods Softw."},{"key":"936_CR28","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"key":"936_CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods II: some corrections. SIAM Rev. 13, 185\u2013188 (1971)","journal-title":"SIAM Rev."},{"issue":"4","key":"936_CR30","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"936_CR31","unstructured":"Nemirovsky, A., Yudin, D.: Problem complexity and method efficiency in optimization. Wiley-Interscience, New York (1983). ISBN 0-471-10345-4"},{"key":"936_CR32","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)$$ o ( 1 \/ k 2 ) . Doklady AN SSSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"936_CR33","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146, 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"936_CR34","first-page":"356","volume":"25","author":"A Nemirovskii","year":"1985","unstructured":"Nemirovskii, A., Nesterov, Y.: Optimal methods for smooth convex minimization. Zh. Vichisl. Mat. Fiz. (in Russian) 25, 356\u2013369 (1985)","journal-title":"Zh. Vichisl. Mat. Fiz. (in Russian)"},{"key":"936_CR35","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonom. i. Mat. Metody 24, 509\u2013517 (1988)","journal-title":"Ekonom. i. Mat. Metody"},{"issue":"1","key":"936_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization. Math. Program. 149(1), 1\u201345 (2015)","journal-title":"Math. Program."},{"key":"936_CR37","unstructured":"Lan, G.: Bundle-type methods uniformly optimal for smooth and non-smooth convex optimization. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611 (2010)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0936-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0936-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0936-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0936-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,26]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["936"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0936-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,26]]}}}