Lecture

Convex Optimization: Dual Cones

In course

Ea non magna aliqua occaecat veniam ad in voluptate amet ad laborum amet aliqua. Ea laboris enim anim mollit aute exercitation magna fugiat enim sint sint incididunt sunt. Reprehenderit esse tempor aliquip sint Lorem excepteur incididunt non irure cillum laboris. Duis incididunt aute aliqua ullamco elit ea. Anim adipisicing ea enim excepteur velit fugiat anim velit. Dolore Lorem do aute fugiat qui eu Lorem est.

Description

This lecture covers the properties of dual cones, including closure, convexity, and self-duality. It explores the definition of dual cones, problems with generalized inequalities, SDP duality, and Karush-Kuhn-Tucker conditions. The relevance of KKT conditions in optimization and separable problems are also discussed.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

dolor et

Occaecat velit fugiat sint quis aliquip laboris magna ut irure aute. Aute sit veniam ullamco non. Sunt sit aliquip est velit.

Official source

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

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

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (29)

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.