Design of distributed and robust optimization algorithms : a systems theoretic approach / Simon Michalowsky.

Intro
1 Introduction
1.1 Motivation and Background
1.2 Problem Formulation
1.3 Contributions and Outline
2 Design of Distributed Optimization Algorithms
2.1 Problem Formulation
2.2 Saddle-Point Dynamics
2.3 Admissible Lie Bracket Representations
2.4 Construction of Distributed Algorithms
2.5 Discussions
2.6 Summary and Conclusion
3 Design of Robust &
Structure Exploiting Optimization Algorithms
3.1 Problem Formulation
3.2 Reformulation in the Robust Control Framework
3.3 Robust Optimization Algorithms
3.4 Structure Exploiting Algorithms
3.5 Discussions
3.6 Summary and Conclusion
4 Summary and Conclusion
A Notation and Technical Background
A.1 Basic Notation
A.2 Basics of Graph Theory
A.3 Lie Brackets and Formal Brackets
A.4 Sequence Spaces and (Linear) Operators
A.5 Convex Functions and Memoryless Monotone Operators
A.6 Some Facts Involving Linear Matrix Inequalities (LMIs)
B Proofs
B.1 Proofs of Chapter 2
B.2 Proofs of Chapter 3
C Additional Material
C.1 Additional Material to Chapter 2
C.2 Additional Material to Chapter 3
List of Symbols
Bibliography.