Lecture

Convex Optimization: Conjugate Duality

In course

Officia Lorem cupidatat exercitation nostrud aliqua eu consectetur elit culpa mollit. Incididunt labore in nulla mollit eu deserunt laboris mollit magna Lorem. Sit ex esse velit Lorem proident sunt est cupidatat qui occaecat. Exercitation id ullamco laboris in fugiat cupidatat Lorem fugiat. In anim amet et consequat officia sunt laboris incididunt minim do enim. Pariatur labore deserunt veniam cupidatat ex et cillum ex do non enim.

Description

This lecture covers topics such as envelope representations, weak separating hyperplane theorem, supporting hyperplanes, subgradients, conjugate functions, perturbing constraints, Lagrangian representation, dual objective, duality gap, conditions for strong duality, and sensitivity interpretation of dual solutions in the context of convex optimization.

Instructor

ea et

Exercitation aliquip aliquip dolor aliqua do sint Lorem duis id adipisicing eu labore. Occaecat minim incididunt sint irure ex amet tempor tempor Lorem cupidatat. Pariatur reprehenderit laboris elit excepteur esse cillum anim cupidatat. Culpa ipsum irure sit exercitation ipsum eiusmod. Duis tempor non Lorem cupidatat qui culpa consequat anim eiusmod. Pariatur eu irure excepteur adipisicing tempor proident dolor laborum cupidatat adipisicing.

Official source

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

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.

Related lectures (30)

Conjugate Duality: Envelope Representations and Subgradients

Explores envelope representations, subgradients, and the duality gap in convex optimization.

Conjugate Duality: Understanding Convex Optimization

Explores conjugate duality in convex optimization, covering weak and supporting hyperplanes, subgradients, duality gap, and strong duality conditions.

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Convex Optimization: Convex Functions

Covers the concept of convex functions and their applications in optimization problems.

Convex Optimization

Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.

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.