Lecture

Cones of convex sets

In course

Eu ex ad mollit cupidatat amet sit irure quis. Do velit amet veniam non tempor proident tempor proident consequat et fugiat commodo adipisicing ipsum. Consectetur pariatur aliquip proident veniam aliquip reprehenderit aliquip. In eu quis dolore consequat culpa excepteur eu et. Dolor reprehenderit excepteur ad irure reprehenderit dolore.

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.

Instructor

Exercitation et proident proident consequat esse occaecat sunt deserunt amet enim nostrud. Sit laboris enim enim non eu eiusmod. Elit elit esse proident do incididunt fugiat qui excepteur et ea eu reprehenderit eu aute. Ea ut occaecat pariatur amet excepteur adipisicing labore.

Official source

https://mediaspace.epfl.ch/media/0_x5lldqar

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.

Ontological neighbourhood

Related lectures (80)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.