Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters
From MaRDI portal
Publication:6149580
DOI10.1007/s10287-023-00493-9arXiv2205.15669OpenAlexW4389847758MaRDI QIDQ6149580
A. V. Gasnikov, Dmitry P. Kovalev, Olga Yufereva, Pavel Dvurechensky, Michael Persiianov
Publication date: 6 February 2024
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.15669
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Efficient numerical methods for entropy-linear programming problems
- Central limit theorems for the Wasserstein distance between the empirical and the true distributions
- Distribution's template estimate with Wasserstein metrics
- A Smoothed Dual Approach for Variational Wasserstein Problems
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- Barycenters in the Wasserstein Space
- Network Consensus in the Wasserstein Metric Space of Probability Measures
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Data-driven regularization of Wasserstein barycenters with an application to multivariate density registration
- Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks
- A dual approach for optimal algorithms in distributed optimization over networks
- Optimal Transport
- Recent theoretical advances in decentralized distributed convex optimization
This page was built for publication: Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters
