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
Lagrangian Duality: Convex Optimization
Graph Chatbot
Related lectures (42)
Convex Relaxation: Negative Type Theorems
Log in to Mediaspace to watch this video
Explores convex relaxation and negative type theorems in convex programs.
Portfolio Optimization: Models and Strategies
Log in to Mediaspace to watch this video
Explores portfolio optimization models and strategies under uncertainty, emphasizing decision criteria like value-at-risk and mean-variance functional.
Previous
Page 3 of 3
Next