This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

What are some recent advances in non-convex optimization research ... It is not possible to find the global optimum of every non-convex problem due to NP-hardness barrier. An alternate approach ...

The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...

This talk presents the latest developments on convex liftings, a tool belonging to the class ... this demonstrates its capability to convexify controller design, fragility analysis of existing ...