Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Cones of convex sets
Description
This lecture covers optimization on convex sets, including KKT points, stationary points, and tangent cones. It explores normal cones, optimality conditions, and special cases defined through equality and inequality constraints. The lecture also delves into global optimality, Slater's condition, and sets of minimizers in convex problems.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.