In full generality, minimizing a polynomial function over a closed semi-algebraic set requires complex mathematical equations. This book explains recent develop

1. The generalized moment problem. 1.1. Formulations. 1.2. Duality theory. 1.3. Computational complexity. 1.4. Summary. 1.5. Exercises. 1.6. Notes and sources -

An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science

Moment and polynomial optimization is an active research field used to solve difficult questions in many areas, including global optimization, tensor computatio

Many applications, including computer vision, computer arithmetic, deep learning, entanglement in quantum information, graph theory and energy networks, can be