This course introduces the fundamentals of convex analysis and its applications in continuous optimization. In the course, the modeling power of convex conic optimization for solving a wide variety of engineering problems will be illustrated. Interior point methods and their iteration complexity analysis will be introduced for solving convex conic optimization models such as semidefinite programming.
Gopher Grades is maintained by Social Coding with data from Summer 2017 to Spring 2026 provided by the University in response to a public records request