[{"day":"19","year":"2023","date_updated":"2023-12-27T13:44:33Z","type":"preprint","oa_version":"Preprint","article_processing_charge":"No","author":[{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida"},{"first_name":"Hugo","last_name":"Lavenant","full_name":"Lavenant, Hugo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.12213","open_access":"1"}],"citation":{"ama":"Ishida S, Lavenant H. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2312.12213\">10.48550/arXiv.2312.12213</a>","ieee":"S. Ishida and H. Lavenant, “Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation,” <i>arXiv</i>. .","chicago":"Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2312.12213\">https://doi.org/10.48550/arXiv.2312.12213</a>.","short":"S. Ishida, H. Lavenant, ArXiv (n.d.).","ista":"Ishida S, Lavenant H. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. arXiv, 2312.12213.","apa":"Ishida, S., &#38; Lavenant, H. (n.d.). Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2312.12213\">https://doi.org/10.48550/arXiv.2312.12213</a>","mla":"Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” <i>ArXiv</i>, 2312.12213, doi:<a href=\"https://doi.org/10.48550/arXiv.2312.12213\">10.48550/arXiv.2312.12213</a>."},"publication_status":"submitted","abstract":[{"lang":"eng","text":"We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton-Jacobi equation."}],"project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"acknowledgement":"The authors would like to thank Chris Wojtan for his continuous support and several interesting discussions. Part of this research was performed during two visits: one of SI to the BIDSA research center at Bocconi University, and one of HL to the Institute of Science and Technology Austria. Both host institutions are warmly acknowledged for the hospital-\r\nity. HL is partially supported by the MUR-Prin 2022-202244A7YL “Gradient Flows and Non-Smooth Geometric Structures with Applications to Optimization and Machine Learning”, funded by the European Union - Next Generation EU. SI is supported in part by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council.","oa":1,"language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2312.12213","_id":"14703","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"title":"Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation","publication":"arXiv","date_published":"2023-12-19T00:00:00Z","keyword":["Optimal transport","Hamilton-Jacobi equation","convex optimization"],"external_id":{"arxiv":["2312.12213"]},"article_number":"2312.12213","status":"public","date_created":"2023-12-21T10:14:37Z","arxiv":1,"month":"12"},{"language":[{"iso":"eng"}],"doi":"10.1145/3465084.3467941","department":[{"_id":"ElKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2023-09-04T11:42:10Z","type":"conference","oa_version":"Preprint","day":"21","publication_identifier":{"isbn":["9-781-4503-8548-0"]},"scopus_import":"1","arxiv":1,"date_published":"2021-07-21T00:00:00Z","external_id":{"isi":["000744439800018"],"arxiv":["2103.03181"]},"keyword":["optimal","state machine replication","fallback","asynchrony","byzantine faults"],"page":"187-190","publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","title":"Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol","oa":1,"_id":"10553","publication_status":"published","abstract":[{"lang":"eng","text":"The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds -- optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live."}],"citation":{"apa":"Gelashvili, R., Kokoris Kogias, E., Spiegelman, A., &#38; Xiang, Z. (2021). Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i> (pp. 187–190). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>","mla":"Gelashvili, Rati, et al. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2021, pp. 187–90, doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, and Z. Xiang, “Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol,” in <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2021, pp. 187–190.","ama":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In: <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2021:187-190. doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>","ista":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. 2021. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 187–190.","chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alexander Spiegelman, and Zhuolun Xiang. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, 187–90. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>.","short":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, Z. Xiang, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 187–190."},"main_file_link":[{"url":"https://arxiv.org/abs/2103.03181","open_access":"1"}],"author":[{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"full_name":"Spiegelman, Alexander","first_name":"Alexander","last_name":"Spiegelman"},{"full_name":"Xiang, Zhuolun","last_name":"Xiang","first_name":"Zhuolun"}],"quality_controlled":"1","year":"2021","isi":1,"date_created":"2021-12-16T13:20:19Z","month":"07","conference":{"start_date":"2021-07-26","location":"Virtual, Italy","name":"PODC: Principles of Distributed Computing","end_date":"2021-07-30"},"status":"public","publisher":"Association for Computing Machinery"}]