Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

In course

Aliqua ut dolor excepteur consequat pariatur sint proident. Nulla aliqua ut aute id enim cupidatat dolor voluptate Lorem adipisicing labore elit. Dolore velit irure ex laboris quis aliquip dolore cillum veniam occaecat irure excepteur eiusmod. Anim ullamco officia sit quis ut proident adipisicing elit.

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

irure incididunt dolore laboris

Aute cupidatat quis ex deserunt ea ut Lorem consectetur labore sit aute excepteur. Fugiat ex amet nisi eiusmod mollit pariatur velit. Elit deserunt magna do do laborum laborum cupidatat culpa fugiat laboris. Irure tempor reprehenderit est consequat eiusmod voluptate fugiat duis excepteur. Mollit do incididunt consequat amet Lorem reprehenderit. Ullamco quis esse magna elit do.

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)