Pouya Rezaeinia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Pouya Rezaeinia has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bahman Gharesifard
Department of Mathematics and Statistics, Queens University, Kingston, ON, Canada
2 shared publications - Tamás Linder
Department of Mathematics and Statistics, Queens University, Kingston, ON, Canada
2 shared publications André de Palma
1 shared publication- Behrouz Touri
Department of Electrical and Computer Engineering, University of California San Diego, La Jolla, CA 92093 USA
1 shared publication Robin Lindsey
1 shared publication
Latest Publications
- 8 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (4) , 2746-2753
Distributed Optimization With Uncertain Communications
We consider a distributed optimization problem for the sum of convex functions where the underlying communication network connecting nodes at each time epoch is drawn at random from a collection of directed graphs. We propose a modified version of the subgradient-push algorithm that provably almost surely converges to an optimizer on any such sequence of random directed graphs. We also prove that the convergence rate of our proposed algorithm is upper bounded as $ O(\frac{1}{\sqrt{t}})$ , where $t$ is the time horizon
- 8 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (4) , 2746-2753
Distributed Optimization With Uncertain Communications
We consider a distributed optimization problem for the sum of convex functions where the underlying communication network connecting nodes at each time epoch is drawn at random from a collection of directed graphs. We propose a modified version of the subgradient-push algorithm that provably almost surely converges to an optimizer on any such sequence of random directed graphs. We also prove that the convergence rate of our proposed algorithm is upper bounded as $ O(\frac{1}{\sqrt{t}})$ , where $t$ is the time horizon
- 17 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (3) , 1295-1302
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to such random scenarios. Provided that an ergodicity notion, which we term the directed infinite flow property, holds and the auxiliary states of agents are uniformly bounded away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a so-called time-varying B-irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm.
- 17 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (3) , 1295-1302
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to such random scenarios. Provided that an ergodicity notion, which we term the directed infinite flow property, holds and the auxiliary states of agents are uniformly bounded away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a so-called time-varying B-irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm.