This web page contains material for the workshop
Convex algebraic geometry, optimization and applications.
Describing convex algebraic sets by linear matrix inequalities by Schweighofer
The geometry of semidefinite programming by Sturmfels
Fundamentals of Convergence Theories
for Convex Relaxation Hierarchies by Tuncel
Finding Low Rank Matrices by Convex Optimization by Fazel
Semide¯nite Programming Rank Reduction for
Graph Realization and Sensor Network
Localization by Ye
------------
A list of registered participants is available.
Talks
Convex but not sos-convex
by Ahmadi
Questions or comments to workshops@aimath.org