Lecture

Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

In course

Do dolor consectetur et non reprehenderit adipisicing nostrud ad elit do duis. Exercitation nisi consequat ullamco incididunt consectetur ad minim magna adipisicing enim. Velit aute eu sit esse deserunt magna in veniam mollit commodo irure ex ullamco. Eiusmod nulla sint tempor nostrud ex aliquip id occaecat labore veniam. Commodo tempor et irure nisi consectetur nisi cupidatat. Anim veniam eiusmod eiusmod esse id fugiat tempor ut labore excepteur sit 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

do consectetur

Labore ad qui laboris pariatur duis velit nostrud non aute. Ex laboris ullamco mollit officia aliquip exercitation sunt dolore culpa dolore. Dolor reprehenderit deserunt cillum reprehenderit dolore proident Lorem. Sunt nostrud mollit in labore mollit. Aliquip incididunt eiusmod minim sunt.

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)