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 course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

A new GPU-powered algorithm, cuTAMP, significantly accelerates complex robot planning by evaluating thousands of action sequences in parallel—solving tasks in seconds that previously took much longer.