{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:16Z","timestamp":1740145156945,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T00:00:00Z","timestamp":1457308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Engineering and Physical Research Council (EPRSC) UK","award":["EP\/H016600\/1"],"award-info":[{"award-number":["EP\/H016600\/1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-015-0991-3","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:41:27Z","timestamp":1457343687000},"page":"81-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A secant-based Nesterov method for convex functions"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5387-3054","authenticated-orcid":false,"given":"Razak O.","family":"Alli-Oke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William P.","family":"Heath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,7]]},"reference":[{"issue":"1","key":"991_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11075-013-9723-x","volume":"66","author":"K Amini","year":"2013","unstructured":"Amini, K., Ahookhosh, M., Nosratipour, H.: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. Numer. Algorithms 66(1), 49\u201378 (2013)","journal-title":"Numer. Algorithms"},{"key":"991_CR2","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.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"991_CR3","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"991_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Candes, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3), 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"991_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0893-6080(03)00170-9","volume":"17","author":"A Bhaya","year":"2004","unstructured":"Bhaya, A., Kaszkurewicz, E.: Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method. Neural Netw. 17(1), 65\u201371 (2004)","journal-title":"Neural Netw."},{"issue":"4","key":"991_CR6","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"991_CR7","volume-title":"Convex Optimization","author":"S Boyd","year":"2009","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2009)"},{"key":"991_CR8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"48","author":"M Collins","year":"2002","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression. Adaboost and Bregman distances. Mach. Learn. 48, 253\u2013285 (2002)","journal-title":"Adaboost and Bregman distances. Mach. Learn."},{"issue":"2","key":"991_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"991_CR10","series-title":"Applied Optimization","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/0-387-24255-4_10","volume-title":"Optimization and Control with Applications","author":"R Fletcher","year":"2005","unstructured":"Fletcher, R.: On the Barzilai\u2013Borwein method. In: Qi, L., Teo, K., Yang, X. (eds.) Optimization and Control with Applications. Applied Optimization, vol. 96, pp. 235\u2013256. Springer, US (2005)"},{"key":"991_CR11","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S.: Fast alternating direction optimization methods. Technical Report, UCLA (May 2012 (Revised January 2014))"},{"key":"991_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0541-z","volume":"138","author":"CC Gonzaga","year":"2013","unstructured":"Gonzaga, C.C., Karas, E.W.: Fine tuning Nesterov\u2019s steepest descent algorithm for differentiable convex programming. Math. Program. Ser. A 138, 141\u2013166 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"991_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11075-012-9668-5","volume":"64","author":"M Gu","year":"2013","unstructured":"Gu, M., Lim, L.H., Wu, C.: ParNes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals. Numer. Algorithms 64(2), 321\u2013347 (2013)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"991_CR14","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/TPAMI.2013.188","volume":"36","author":"R He","year":"2014","unstructured":"He, R., Tan, T., Wang, L.: Robust recovery of corrupted low-rank matrix by implicit regularizers. IEEE Trans. Pattern Anal. Mach. Intell. 36(4), 770\u2013783 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"991_CR15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s10915-009-9314-0","volume":"42","author":"SL Hu","year":"2010","unstructured":"Hu, S.L., Huang, Z.H., Lu, N.: A nonmonotone line search algorithm for unconstrained optimization. J. Sci. Comput. 42, 38\u201353 (2010)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"991_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/10556788.2014.911298","volume":"30","author":"A Kozma","year":"2015","unstructured":"Kozma, A., Conte, C., Diehl, M.: Benchmarking large-scale distributed convex quadratic programming algorithms. Optim. Methods Softw. 30(1), 191\u2013214 (2015)","journal-title":"Optim. Methods Softw."},{"key":"991_CR17","doi-asserted-by":"crossref","unstructured":"Kozma, A., Frasch, J.V., Diehl, M.: A distributed method for convex quadratic programming problems arising in optimal control of distributed systems. In: Proceedings of the 52nd IEEE Conference on Decision and Control, Florence, Italy (December 2013)","DOI":"10.1109\/CDC.2013.6760099"},{"issue":"1\u20132","key":"991_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1\u20132), 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"991_CR19","doi-asserted-by":"crossref","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. In: Proceedings of The 31st International Conference on Machine Learning, Beijing, China (2014)","DOI":"10.1007\/s10589-014-9694-4"},{"issue":"1\u20134","key":"991_CR20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., Meszaros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11(1\u20134), 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"key":"991_CR21","unstructured":"Meng, X., Chen, H.: Accelerating Nesterov\u2019s method for strongly convex functions with Lipschitz gradient. Math. Optim. Control 90C25, 1\u201313 (2011). arXiv:1109.6058v1"},{"key":"991_CR22","unstructured":"Nemirovski, A.S.: Efficient methods in convex programming, Lecture Notes, Technion-Israel Institute of Technology (1994)"},{"issue":"2","key":"991_CR23","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate of ( $$1\/k^2$$ 1 \/ k 2 ). Sov. Math. Doklady 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Doklady"},{"key":"991_CR24","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Programming: A Basic Course. Kluwer Academic Publishers, Dordrecht (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"991_CR25","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. CORE discussion paper (2007)"},{"key":"991_CR26","unstructured":"Nicolas, L.R., Mark, S., Francis, B.: A stochastic gradient method with an exponential convergence rate for finite training sets. Math. Optim. Control 1\u201334 (2013). arXiv:1202.6258v4"},{"key":"991_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"key":"991_CR28","doi-asserted-by":"crossref","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. (2013)","DOI":"10.1007\/s10208-013-9150-3"},{"key":"991_CR29","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: An accelerated dual gradient-projection algorithm for linear model predictive control. In: Proceedings of the 51st IEEE Conference on Decision and Control. Maui, US (December 2012)","DOI":"10.1109\/CDC.2012.6426458"},{"key":"991_CR30","unstructured":"Pedregosa, F.: Numerical optimizers for logistic regression (2013). http:\/\/fa.bianp.net\/blog\/2013\/numerical-optimizers-for-logistic-regression\/#fn:2"},{"issue":"5","key":"991_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"991_CR32","doi-asserted-by":"crossref","unstructured":"Richter, S., Jones, C.N., Morari, M.: Real-time input-constrained MPC using fast gradient methods. In: Proceedings of the 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, China (December 2009)","DOI":"10.1109\/CDC.2009.5400619"},{"issue":"1","key":"991_CR33","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0112007","volume":"12","author":"B Shah","year":"1964","unstructured":"Shah, B., Buehler, R., Kempthorne, O.: Some algorithms for minimizing a function of several variables. J. Soc. Ind. Appl. Math. 12(1), 74\u201392 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"991_CR34","unstructured":"Telgarsky, M.: Steepest descent analysis for unregularized linear prediction with strictly convex penalties. In: Proceedings of the 4th International Workshop on Optimization for Machine Learning (OPT), held as a part of the NIPS workshops series (December 2011)"},{"issue":"3","key":"991_CR35","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/TNN.2002.1000143","volume":"13","author":"M Torii","year":"2002","unstructured":"Torii, M., Hagan, M.T.: Stability of steepest descent with momentum for quadratic functions. IEEE Trans. Neural Netw. 13(3), 752\u2013756 (2002)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4\u20135","key":"991_CR36","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00332914","volume":"59","author":"TP Vogl","year":"1988","unstructured":"Vogl, T.P., Mangis, J., Rigler, A., Zink, W., Alkon, D.: Accelerating the convergence of the back-propagation method. Biol. Cybern. 59(4\u20135), 257\u2013263 (1988)","journal-title":"Biol. Cybern."},{"issue":"4","key":"991_CR37","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/S0031-3203(00)00036-4","volume":"34","author":"PL Worthington","year":"2001","unstructured":"Worthington, P.L., Hancock, E.R.: Surface topography using shape-from-shading. Pattern Recognit. 34(4), 823\u2013840 (2001)","journal-title":"Pattern Recognit."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0991-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0991-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0991-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0991-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T04:55:21Z","timestamp":1567659321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0991-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,7]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0991-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,3,7]]}}}