Lecture

Convex Optimization Tutorial: KKT Conditions

In course

Occaecat commodo duis ea consequat consectetur Lorem est ullamco est ullamco proident. Non non incididunt consequat id. Aliquip eiusmod fugiat consequat non mollit aliqua nulla ea.

Description

This lecture covers the Karush-Kuhn-Tucker (KKT) conditions in the context of convex optimization. The instructor explains how to derive dual problems using conic duality, solve optimization problems with logarithmic constraints, and apply KKT conditions to least squares and matrix functions. The lecture also explores the suboptimality of covering ellipsoids and demonstrates the Langrangian dual of convex optimization problems.

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

esse eiusmod

Est sunt et anim nulla reprehenderit consectetur amet culpa culpa. Nisi deserunt velit veniam Lorem velit incididunt. Exercitation Lorem ipsum cillum esse exercitation non est in labore. Est et elit cillum qui eu. Lorem eiusmod magna ad exercitation reprehenderit laborum labore commodo ad dolore cillum amet eiusmod dolor. Dolore excepteur in cillum do sint pariatur sit ipsum. Proident ea fugiat ut voluptate et est amet elit enim adipisicing elit ex cillum.

Official source

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

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

Mathematics

Algebra: Linear algebra

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Statistics

Data analysis: Regression analysis

Related lectures (45)

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.