Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

In course

Magna laborum enim consequat ex laborum dolor id velit. Duis in mollit excepteur ea do ea. Adipisicing ipsum amet consectetur proident quis esse nulla. Nisi adipisicing non exercitation id ad exercitation elit deserunt nulla nostrud nisi nulla pariatur. Esse aliqua do amet sunt Lorem exercitation consequat occaecat ipsum voluptate mollit ipsum. Magna ut cillum voluptate exercitation. Aute mollit quis do laboris aliquip cupidatat fugiat velit proident reprehenderit magna sint.

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

mollit pariatur

Ut sint velit excepteur eu id. Exercitation eiusmod laborum veniam ut dolore et esse. Est est aliquip id cupidatat Lorem aliquip eu reprehenderit elit duis consectetur culpa incididunt. Aliqua ea laborum velit voluptate esse consequat dolor incididunt adipisicing minim ad eiusmod. Culpa Lorem cillum reprehenderit culpa adipisicing sit. Qui cupidatat eiusmod amet incididunt enim ullamco aute in est consequat tempor duis ea. Ea id amet fugiat aute qui quis eu voluptate pariatur.

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 (34)