Concept
Slater's condition
Related lectures (26)
Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation
Explores constrained convex optimization with min-max formulation and Fenchel conjugation.
Minimax Optimization: Theory and Algorithms
Explores minimax optimization theory, including weak and strong duality, saddle points, and practical algorithm performance.
Primal-dual Optimization: Fundamentals
Explores primal-dual optimization, minimax problems, and gradient descent-ascent methods for optimization algorithms.
Two Inequalities and Feasible Cone: Linearized Approach
Explains feasible directions, linearized cone, and Constraint Qualification conditions in optimization.
KKT for convex problems and Slater's CQ
Covers the KKT conditions and Slater's condition in convex optimization problems.
Cones of convex sets
Explores optimization on convex sets, including KKT points and tangent cones.
Convex Optimization: Dual Cones
Explores dual cones, generalized inequalities, SDP duality, and KKT conditions in convex optimization.
Conjugate Duality: Envelope Representations and Subgradients
Explores envelope representations, subgradients, and the duality gap in convex optimization.
Convex Optimization: Self-dual Cones
Explores self-dual cones in convex optimization and their applications in various optimization problems.
Distributionally Robust Portfolio Optimization
Explores distributionally robust portfolio optimization and compares different estimation approaches and methods for portfolio evaluation.