Lecture
Legendre Transform
In course
DEMO: enim ad
Sint ullamco do consequat consectetur Lorem proident sit excepteur Lorem fugiat ad aliqua. Dolor eiusmod incididunt nostrud cillum. Nulla nostrud ex ullamco mollit adipisicing. Laborum quis nostrud aliqua consequat quis pariatur nostrud duis. Exercitation est exercitation culpa esse veniam pariatur excepteur culpa sunt. Eu dolor minim dolore dolor consectetur commodo. Eiusmod aliquip dolore nulla aliqua in cupidatat dolore id excepteur et laboris aliquip nisi.
Description
This lecture covers the Legendre transform and duality in convex analysis, discussing the definition of the Legendre transform, its properties, and its application in optimization problems. It also explores the concept of conjugate functions, Fenchel duality, and Caroli's theorem.
Official source
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
Related lectures (64)
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
Weak and Strong Duality
Covers weak and strong duality in optimization problems, focusing on Lagrange multipliers and KKT conditions.
Convexity of Lovász Extension
Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.