Related lectures (817)
Optimal Control: Unconstrained and Constrained Problems
Explores optimal control in unconstrained and constrained problems, emphasizing the importance of sparsity.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation
Explores constrained convex optimization with min-max formulation and Fenchel conjugation.
Simulation & Optimization: Poisson Process & Random Numbers
Explores simulation pitfalls, random numbers, discrete & continuous distributions, and Monte-Carlo integration.
Legendre Transform
Explores the Legendre transform, duality in convex analysis, and optimization problems.
KKT for convex problems and Slater's CQ
Covers the KKT conditions and Slater's condition in convex optimization problems.
Implicit Bias in Machine Learning
Explores implicit bias, gradient descent, stability in optimization algorithms, and generalization bounds in machine learning.
Convex Optimization: Gradient Algorithms
Covers convex optimization problems and gradient-based algorithms to find the global minimum.
Convex Optimization Problems: Theory and Applications
Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.
Lagrange Multipliers Theorem
Explores the Lagrange multipliers theorem for n>2, demonstrating its application in optimization problems with constraints.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.