Lecture

Conjugate Duality: Envelope Representations and Subgradients

Description

This lecture covers the concept of conjugate duality in convex optimization, focusing on envelope representations and subgradients. It explains the theorems related to proper, convex, and closed functions, such as the pointwise supremum of affine functions and supporting hyperplanes. The lecture also delves into the definition of subgradients and the subdifferential of a function. Key takeaways include the understanding of conjugate functions, the biconjugate, and the duality gap in optimization problems.

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.

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.