activity
20132026
most citedDecentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

21 citations · 69 across the 11 of their papers we have counts for

collaborators
Showing math.OCShow all

10 papers · 1 filter

math.OC2021★ 2 cited

Characterizing Trust and Resilience in Distributed Consensus for Cyberphysical Systems

Michal Yemini, Angelia Nedić, Andrea Goldsmith +1

This work considers the problem of resilient consensus where stochastic values of trust between agents are available. Specifically, we derive a unified mathematical framework to ch…

math.OC2021★ 12 cited

Distributed Augmented Lagrangian Method for Link-Based Resource Sharing Problems of Multi-Agent Systems

Wicak Ananduta, Angelia Nedić, Carlos Ocampo-Martinez

A multi-agent optimization problem motivated by the management of energy systems is discussed. The associated cost function is separable and convex although not necessarily strongl…

math.OC2020

Accelerated Multi-Agent Optimization Method over Stochastic Networks

Wicak Ananduta, Carlos Ocampo-Martinez, Angelia Nedić

We propose a distributed method to solve a multi-agent optimization problem with strongly convex cost function and equality coupling constraints. The method is based on Nesterov's…

math.OC2019

Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets

Tatiana Tatarenko, Angelia Nedich

We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has ac…

math.OC2018★ 21 cited

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

Pavel Dvurechensky, Darina Dvinskikh, Alexander Gasnikov +2

We study the decentralized distributed computation of discrete approximations for the regularized Wasserstein barycenter of a finite set of continuous probability measures distribu…

math.OC2018★ 18 cited

Optimal Distributed Optimization on Slowly Time-Varying Graphs

Alexander Rogozin, César A. Uribe, Alexander Gasnikov +2

We study optimal distributed first-order optimization algorithms when the network (i.e., communication constraints between the agents) changes with time. This problem is motivated…