{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:49:43Z","timestamp":1775000983445,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032157904","type":"print"},{"value":"9783032157911","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15791-1_8","type":"book-chapter","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:50:02Z","timestamp":1774997402000},"page":"104-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fully Adaptive Frank-Wolfe Algorithm for\u00a0Relatively Smooth Problems and\u00a0Its Application to\u00a0Centralized Distributed Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1681-1750","authenticated-orcid":false,"given":"A. A.","family":"Vyguzov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9250-4438","authenticated-orcid":false,"given":"F. S.","family":"Stonyakin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"8_CR1","unstructured":"Arjevani, Y., Shamir, O.: Communication complexity of distributed convex learning and optimization. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Beznosikov, A., Gasnikov, A.: Compression and data similarity: Combination of two techniques for communication-efficient solving of distributed variational inequalities. Olenev, N., Evtushenko, Y., Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V., Pospelov, I. (eds.) International Conference on Optimization and Applications. pp. 151\u2013162. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22543-7_11","DOI":"10.1007\/978-3-031-22543-7_11"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Beznosikov, A., Tak\u00e1\u010d, M., Gasnikov, A.: Similarity, compression and local steps: three pillars of efficient communications for distributed variational inequalities. arXiv preprint arXiv:2302.07615 (2023)","DOI":"10.52202\/075280-1246"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Rinaldi, F., Zeffiro, D.: Frank-wolfe and friends: a journey into projection-free first-order optimization methods. 4OR 19, 313\u2013345 (2021)","DOI":"10.1007\/s10288-021-00493-y"},{"key":"8_CR6","unstructured":"Braun, G., et al.: Conditional gradient methods. arXiv preprint arXiv:2211.14103 (2022)"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1214\/aos\/1176348385","volume":"19","author":"I Csiszar","year":"1991","unstructured":"Csiszar, I.: Why least squares and maximum entropy? an axiomatic approach to inference for linear inverse problems. Ann. Stat. 19(4), 2032\u20132066 (1991)","journal-title":"Ann. Stat."},{"key":"8_CR8","unstructured":"Ghojogh, B., Ghodsi, A., Karray, F., Crowley, M.: Kkt conditions, first-order and second-order optimization, and distributed optimization: tutorial and survey. arXiv preprint arXiv:2110.01858 (2021)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-021-00273-8","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richtarik, P., Xiao, L.: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. Comput. Optim. Appl. 79, 405\u2013440 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"8_CR10","unstructured":"Hendrikx, H., Xiao, L., Bubeck, S., Bach, F., Massoulie, L.: Statistically preconditioned accelerated gradient method for distributed optimization. In: International conference on machine learning. pp. 4203\u20134227. PMLR (2020)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"8_CR12","unstructured":"Pedregosa, F., Negiar, G., Askari, A., Jaggi, M.: Linearly convergent frank-wolfe with backtracking line-search. In: International conference on artificial intelligence and statistics. pp. 1\u201310. PMLR (2020)"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Rogozin, A., Lukoshkin, V., Gasnikov, A., Kovalev, D., Shulgin, E.: Towards accelerated rates for distributed optimization over time-varying networks. In: Olenev, N.N., Evtushenko, Y.G., Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V. (eds.) Optimization and Applications: 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27\u2013October 1, 2021, Proceedings 12. pp. 258\u2013272. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-91059-4_19","DOI":"10.1007\/978-3-030-91059-4_19"},{"key":"8_CR14","unstructured":"Shamir, O., Srebro, N., Zhang, T.: Communication-efficient distributed optimization using an approximate newton-type method. In: International conference on machine learning. pp. 1000\u20131008. PMLR (2014)"},{"key":"8_CR15","unstructured":"Takahashi, S., Pokutta, S., Takeda, A.: Fast frank-wolfe algorithms with adaptive bregman step-size for weakly convex functions. arXiv preprint arXiv:2504.04330 (2025)"},{"key":"8_CR16","unstructured":"Tian, Y., Scutari, G., Cao, T., Gasnikov, A.: Acceleration in distributed optimization under similarity. In: International Conference on Artificial Intelligence and Statistics. pp. 5721\u20135756. PMLR (2022)"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1134\/S0965542524702208","volume":"65","author":"AA Vyguzov","year":"2025","unstructured":"Vyguzov, A.A., Stonyakin, F.S.: An adaptive variant of the Frank-Wolfe method for relative smooth convex optimization problems. Comput. Math. Math. Phys. 65(3), 591\u2013602 (2025)","journal-title":"Comput. Math. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15791-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:50:03Z","timestamp":1774997403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15791-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032157904","9783032157911"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15791-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf-optima.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}