| 159 | -- | 162 | Dimitri P. Bertsekas, Zhi-Quan Luo. Preface |
| 163 | -- | 195 | Dimitri P. Bertsekas. Incremental proximal methods for large scale convex optimization |
| 197 | -- | 224 | Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang. A stackelberg game approach to distributed spectrum management |
| 225 | -- | 253 | Angelia Nedic. Random algorithms for convex minimization problems |
| 255 | -- | 284 | Ilan Lobel, Asuman E. Ozdaglar, Diego Feijer. Distributed multi-agent optimization with state-dependent communication |
| 285 | -- | 299 | Dongdong Ge, Xiaoye Jiang, Yinyu Ye. p minimization |
| 301 | -- | 329 | Xiaojin Zheng, Xiaoling Sun, Duan Li. Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation |
| 331 | -- | 355 | Sangwoon Yun, Paul Tseng, Kim-Chuan Toh. A block coordinate gradient descent method for regularized convex separable optimization and covariance selection |
| 357 | -- | 382 | Anthony Man-Cho So. Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems |
| 383 | -- | 402 | Etienne de Klerk, Marianna E.-Nagy. On the complexity of computing the handicap of a sufficient matrix |