We study nonconvex distributed optimization in multi-agent networks with
time-varying (nonsymmetric) connectivity. We introduce the first algorithmic
framework for the distributed minimization of the sum of a smooth (possibly
nonconvex and nonseparable) function - the agents' sum-utili