{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:43:34Z","timestamp":1743122614083,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628666"},{"type":"electronic","value":"9783030628673"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_18","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"239-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Penalty-Based Method for Decentralized Optimization over Time-Varying Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2680","authenticated-orcid":false,"given":"Alexander","family":"Rogozin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"18_CR1","unstructured":"Arjevani, Y., Shamir, O.: Communication complexity of distributed convex learning and optimization. In: Advances in Neural Information Processing Systems, pp. 1756\u20131764 (2015)"},{"key":"18_CR2","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, vol. 23. Prentice hall, Englewood Cliffs (1989)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE\/ACM Trans. Netw. 14(SI), 2508\u20132530 (2006)","DOI":"10.1109\/TIT.2006.874516"},{"issue":"3\u20134","key":"18_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"18_CR5","first-page":"27","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"18_CR6","unstructured":"Dvinskikh, D., Gasnikov, A.: Decentralized and parallelized primal and dual accelerated methods for stochastic convex programming problems. arXiv preprint arXiv:1904.09015 (2019)"},{"key":"18_CR7","unstructured":"Gasnikov, A.: Universal gradient descent. arXiv:1711.00394 (2018). [in Russian]"},{"key":"18_CR8","unstructured":"Gorbunov, E., Dvinskikh, D., Gasnikov, A.: Optimal decentralized distributed algorithms for stochasticconvex optimization. arXiv preprint arXiv:1911.07363 (2019)"},{"key":"18_CR9","unstructured":"Hendrikx, H., Bach, F., Massouli\u00e9, L.: Accelerated decentralized optimization with local updates for smooth and strongly convex objectives. arXiv preprint arXiv:1810.02660 (2018)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Lan, G., Lee, S., Zhou, Y.: Communication-efficient algorithms for decentralized and stochastic optimization. Mathematical Programming, pp. 1\u201348 (2018)","DOI":"10.1007\/s10107-018-1355-4"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ins.2017.09.038","volume":"422","author":"Q L\u00fc","year":"2018","unstructured":"L\u00fc, Q., Li, H., Xia, D.: Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes. Inf. Sci. 422, 516\u2013530 (2018)","journal-title":"Inf. Sci."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Maros, M., Jald\u00e9n, J.: Panda: a dual linearly converging method for distributed optimization over time-varying undirected graphs. 2018 IEEE Conference on Decision and Control (CDC), pp. 6520\u20136525 (2018)","DOI":"10.1109\/CDC.2018.8619626"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1137\/16M1084316","volume":"27","author":"A Nedi\u0107","year":"2017","unstructured":"Nedi\u0107, A., Olshevsky, A., Shi, W.: Achieving geometric convergence for distributed optimization over time-varying graphs. SIAM J. Optimization 27(4), 2597\u20132633 (2017)","journal-title":"SIAM J. Optimization"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","volume":"60","author":"A Nedi\u0107","year":"2014","unstructured":"Nedi\u0107, A., Olshevsky, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Automatic Control 60(3), 601\u2013615 (2014)","journal-title":"IEEE Trans. Automatic Control"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Olshevsky, A., Shi, W., Uribe, C.A.: Geometrically convergent distributed optimization with uncoordinated step-sizes. In: 2017 American Control Conference (ACC), pp. 3950\u20133955. IEEE (2017)","DOI":"10.23919\/ACC.2017.7963560"},{"key":"18_CR16","unstructured":"Nemirovskii, A.: Yudin: Problem Complexity and Method Efficiency in Optimization. Wiley (1983)"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. A Basic Course. Springer, Boston (2013). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"18_CR18","unstructured":"Nikaido, H.: Convex Structures and Economic Theory. Academic Press (1968)"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"3990","DOI":"10.1137\/16M1076629","volume":"55","author":"A Olshevsky","year":"2017","unstructured":"Olshevsky, A.: Linear time average consensus and distributed optimization on fixed graphs. SIAM J. Control Optimization 55(6), 3990\u20134014 (2017)","journal-title":"SIAM J. Control Optimization"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Rogozin, A., Uribe, C., Gasnikov, A., Malkovskii, N., Nedich, A.: Optimal distributed convex optimization on slowly time-varying graphs. In: IEEE Transactions on Control of Network Systems (2019)","DOI":"10.1109\/TCNS.2019.2949439"},{"key":"18_CR21","unstructured":"Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., Massouli\u00e9, L.: Optimal algorithms for smooth and strongly convex distributed optimization in networks. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 3027\u20133036. PMLR (2017)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Van Scoy, B., Lessard, L.: A distributed optimization algorithm over time-varying graphs with efficient gradient evaluations. https:\/\/vanscoy.github.io\/docs\/papers\/vanscoy2019distributed.pdf (2019)","DOI":"10.1016\/j.ifacol.2019.12.181"}],"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-030-62867-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:04:17Z","timestamp":1619265857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","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":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.23","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}