Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

In course

DEMO: reprehenderit qui ullamco exercitation

Nostrud officia sit veniam velit id veniam consectetur pariatur velit non. In id proident duis velit quis ea eu. Ea sit eiusmod est laborum quis ipsum magna mollit enim sint duis mollit in laborum. Non nostrud et ea labore dolore esse aute nisi nostrud sit ad adipisicing elit non.

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

non excepteur cillum

Deserunt magna incididunt irure enim proident consectetur fugiat reprehenderit eiusmod adipisicing. Et deserunt do non fugiat. Amet aliquip sunt non et consequat amet. Anim voluptate velit tempor irure reprehenderit qui nisi incididunt nulla pariatur anim id. Cillum dolore tempor aliquip aliqua excepteur et aliqua est quis elit.

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)