Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Convex Optimization Problems
Graph Chatbot
Related lectures (35)
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
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.
Primal-dual Optimization III: Lagrangian Gradient Methods
Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.
Optimization Techniques: Convexity in Machine Learning
Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.
Convex Optimization: Exercises
Log in to Mediaspace to watch this video
Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.
Convex Optimization: Convex Functions
Log in to Mediaspace to watch this video
Covers the concept of convex functions and their applications in optimization problems.
KKT and Convex Optimization
Log in to Mediaspace to watch this video
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Linear Programming Techniques in Reinforcement Learning
Log in to Mediaspace to watch this video
Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.
Convex Optimization
Log in to Mediaspace to watch this video
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
Optimal Transport: Rockafellar Theorem
Log in to Mediaspace to watch this video
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
KKT for convex problems and Slater's CQ
Log in to Mediaspace to watch this video
Covers the KKT conditions and Slater's condition in convex optimization problems.
Convex Optimization Problems: Theory and Applications
Log in to Mediaspace to watch this video
Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.
Optimization Problems: Path Finding and Portfolio Allocation
Log in to Mediaspace to watch this video
Covers optimization problems in path finding and portfolio allocation.
Convex Optimization: Theory and Applications
Log in to Mediaspace to watch this video
Explores convex optimization theory, covering local and global minima, convex functions, and applications in various fields.
Convex Optimization Problems: Standard Form
Log in to Mediaspace to watch this video
Covers convex optimization problems, transformation to standard form, and optimality criteria for differentiable objectives.
Convex Optimization: Gradient Descent
Log in to Mediaspace to watch this video
Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.
Convex Optimization: Introduction and Sets
Log in to Mediaspace to watch this video
Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Convex Optimization: Dual Cones
Log in to Mediaspace to watch this video
Explores dual cones, generalized inequalities, SDP duality, and KKT conditions in convex optimization.
Conjugate Duality: Envelope Representations and Subgradients
Log in to Mediaspace to watch this video
Explores envelope representations, subgradients, and the duality gap in convex optimization.
Conjugate Duality: Understanding Convex Optimization
Log in to Mediaspace to watch this video
Explores conjugate duality in convex optimization, covering weak and supporting hyperplanes, subgradients, duality gap, and strong duality conditions.
Previous
Page 1 of 2
Next