{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:50Z","timestamp":1761294350020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030821920"},{"type":"electronic","value":"9783030821937"}],"license":[{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-82193-7_33","type":"book-chapter","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T15:23:39Z","timestamp":1628004219000},"page":"499-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sublinear Regret with Barzilai-Borwein Step Sizes"],"prefix":"10.1007","author":[{"given":"Iyanuoluwa","family":"Emiola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,4]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Barzilai, J., Borwein, J.N.: Two-point step size gradient methods. IMA J. Num. Anal. 8(1), 141\u2013148 (1988)","DOI":"10.1093\/imanum\/8.1.141"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-newton method for large-scale optimization. SIAM J. Opt. 26(2), 1008\u20131031 (2016)","DOI":"10.1137\/140954362"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Yuan, Y.-X.: Global convergence of a cass of quasi-newton methods on convex problems. SIAM J. Num. Anal. 24(5), 1171\u20131190 (1987)","DOI":"10.1137\/0724077"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chen, T., Ling, Q., Giannakis, G.B.: An online convex optimization approach to proactive network resource allocation. IEEE Tran. Sig. Process. 65(24), 6350\u20136364 (2017)","DOI":"10.1109\/TSP.2017.2750109"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Dai, Y.-H.: A new analysis on the barzilai-borwein gradient method. J. Oper. Res. Soc. China 1(2), 187\u2013198 (2013)","DOI":"10.1007\/s40305-013-0007-x"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Dai, Y.-H., Fletcher, R.: Projected barzilai-borwein methods for large-scale box-constrained quadratic programming. Num. Math. 100(1), 21\u201347 (2005)","DOI":"10.1007\/s00211-004-0569-y"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"Y-H Dai","year":"2002","unstructured":"Dai, Y.-H., Liao, L.-Z.: R-linear convergence of the barzilai and borwein gradient method. IMA J. Num. Anal. 22(1), 1\u201310 (2002)","journal-title":"IMA J. Num. Anal."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Eisen, M., Mokhtari, A., Ribeiro, A.: Decentralized quasi-newton methods. IEEE Trans. Sig. Process. 65(10), 2613\u20132628 (2017)","DOI":"10.1109\/TSP.2017.2666776"},{"key":"33_CR10","unstructured":"Emiola, I., Adem, R.: Comparison of optimization methods with application to a network containing malicious agents. arXiv preprint arXiv:2101.10546 (2021)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Emiola, I., Njilla, L., Enyioha, C.: On distributed optimization in the presence of malicious agents. arXiv preprint arXiv:2101.09347 (2021)","DOI":"10.1109\/CISS50987.2021.9400255"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Murray, W.: Quasi-newton methods for unconstrained optimization. IMA J. Appl. Math. 9(1), 91\u2013108 (1972)","DOI":"10.1093\/imamat\/9.1.91"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Hazan, E., et\u00a0al.: Introduction to online convex optimization. Found Optim. 2(3\u20134), 157\u2013325 (2016)","DOI":"10.1561\/2400000013"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Lesage-Landry, A., Taylor, J., hames, I.: Second-order online nonconvex optimization. IEEE Trans. Autom. Cont. (2020)","DOI":"10.1109\/TAC.2020.3040372"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Li, D.-H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11(4), 1054\u20131064 (2001)","DOI":"10.1137\/S1052623499354242"},{"key":"33_CR16","unstructured":"Mahdavi, M., Jin, R., Yang, T.: Trading regret for efficiency: online convex optimization with long term constraints. J. Mach. Learni. Res. 13(Sep), 2503\u20132528 (2012)"},{"key":"33_CR17","unstructured":"Mcmahan, B., Streeter, M.: No-regret algorithms for unconstrained online convex optimization. In: Advances in Neural Information Processing Systems, pp. 2402\u20132410 (2012)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Mokhtari, A., Shahrampour, S., Jadbabaie, A., Ribeiro, A.: Online optimization in dynamic environments: improved regret rates for strongly convex problems. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 7195\u20137201. IEEE (2016)","DOI":"10.1109\/CDC.2016.7799379"},{"key":"33_CR19","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Programming volume i: Basic course. Lect. Notes 3(4), 5 (1998)"},{"key":"33_CR20","unstructured":"Schraudolph, N.N., Yu, J., G\u00fcnter. S.: A stochastic quasi-newton method for online convex optimization. In: Artificial Intelligence and Statistics, pp. 436\u2013443 (2007)"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Sedrakyan, H., Sedrakyan, N.: Algebraic inequalities. Springer, New York (2018)","DOI":"10.1007\/978-3-319-77836-5"},{"key":"33_CR22","unstructured":"Shalev-Shwartz, S., Kakade, S.M.: Mind the duality gap: logarithmic regret algorithms for online optimization. In: Advances in Neural Information Processing Systems, pp. 1457\u20131464 (2009)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Sharma, P., Khanduri, P., Shen, L., Bucci, D.J., Jr., Varshney, P.K.: On distributed online convex optimization with sublinear dynamic regret and fit. arXiv preprint arXiv:2001.03166 (2020)","DOI":"10.1109\/IEEECONF53345.2021.9723285"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Sofi, A.Z.M., Mamat, M., Ibrahim, M.A.H.: Reducing computation time in dfp (davidon, fletcher & powell) update method for solving unconstrained optimization problems. In: AIP Conference Proceedings, vol. 1522, pp. 1337\u20131345. AIP (2013)","DOI":"10.1063\/1.4801284"},{"key":"33_CR25","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling nesterov\u2019s accelerated gradient method: theory and insights. In: Advances in Neural Information Processing Systems, pp. 2510\u20132518 (2014)"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Yi, X., Li, X., Xie, L., Johansson, K.H.: Distributed online convex optimization with time-varying coupled inequality constraints. IEEE Trans. Sig. Process. 68, 731\u2013746 (2020)","DOI":"10.1109\/TSP.2020.2964200"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Ravier, R.J., Zavlanos, M.M., Tarokh, V.: A distributed online convex optimization algorithm with improved dynamic regret. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 2449\u20132454. IEEE (2019)","DOI":"10.1109\/CDC40024.2019.9029474"},{"key":"33_CR28","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning (ICML 2003), pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82193-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T10:05:34Z","timestamp":1672999534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82193-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,4]]},"ISBN":["9783030821920","9783030821937"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82193-7_33","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,8,4]]},"assertion":[{"value":"4 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IntelliSys","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Proceedings of SAI Intelligent Systems Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intellisys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saiconference.com\/IntelliSys","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}