Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
KKT for convex problems and Slater's CQ
Graph Chatbot
Related lectures (28)
Previous
Page 3 of 3
Next
Convex Optimization: Convex Functions
Covers the concept of convex functions and their applications in optimization problems.
Convex Optimization: Exercises
Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.
The Hidden Convex Optimization Landscape of Deep Neural Networks
Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.
Convex Optimization Problems: Standard Form
Covers convex optimization problems, transformation to standard form, and optimality criteria for differentiable objectives.
Linear Programming Basics
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Optimization Programs: Piecewise Linear Cost Functions
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
Convex Sets: MGT-418 Lecture
On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.
Optimization Problems: Standard Form
Explores optimization problems in standard form, convex optimization, and optimality criteria.