Optimization over time-varying directed graphs with row and column-stochastic matrices
In this paper, we provide a distributed optimization algorithm, termed as TV-$\mathcal{AB}$, that minimizes a sum of convex functions over time-varying, random directed graphs. Contrary to the existing work, the algorithm we propose does not require eigenvector estimation to estimate the (non-$\math...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
17.10.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!