Chapter 1: Basics of Linear Convex Optimization

Convex relaxations are basic tools for solving moment and polynomial optimization problems. This chapter reviews some backgrounds for convex optimization. We introduce basic topics such as vector spaces, convex sets and convex cones, positive semidefinite cones, linear matrix inequalities, semidefinite programming, linear conic optimization, and linear convex formulation for moment and polynomial optimization.