Lecture

Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

In course

Eu exercitation amet aliquip laborum non proident cillum ex irure reprehenderit nisi aliqua proident. Duis aliqua est veniam qui do ex. Sint consectetur nostrud veniam esse anim laboris mollit. Ex labore exercitation eiusmod aliquip labore exercitation.

Description

This lecture covers the constrained convex optimization problem, introducing a min-max formulation using Fenchel conjugation. It explores the relationship between Lagrangian functions and conjugate functions, emphasizing the indicator function and Slater's condition.

Instructor

magna consequat aliquip

Tempor cillum dolor officia commodo reprehenderit sint qui commodo laborum. Id mollit nostrud duis mollit. Aliquip minim cupidatat commodo ad proident id exercitation ullamco Lorem anim voluptate.

Official source

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

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

Mathematics

Analysis: Functional analysis

Related lectures (33)