1 Introduction  
1.1 Notation  
1.2 Solution accuracy  
1.3 Paper organization  

2 Time-varying consensus  
2.1 Mixing matrix  
2.2 Gossip matrix  
2.3 Multi-step consensus  

3 Optimization  
3.1 Definitions and assumptions  
3.2 Algorithm techniques  
3.3 Primal oracle  
3.4 Dual oracle  
3.5 Finite-sum problems  
3.6 Time-varying network as a stochastic sequence  
3.7 Statistical similarity  
3.8 Problems with affine constraints  

4 Saddle-point problems  
4.1 Definitions and assumptions  
4.2 Results for deterministic and stochastic oracle  
4.3 Finite-sum problems  
4.4 Different strong convexity and strong concavity constants  

5 Conclusions