Convexity and Global Minima in Optimization
Investigate the foundational principle in convex optimization: how convexity guarantees that any local minimum is inherently a global minimum, complete with a formal proof.
The key result in convex optimization is that a local minimum is a global minimum for a convex function over a convex set.
This video was produced at the University of Washington, and we acknowledge funding support from the Boeing Company.
Discussion
0Join the discussion — share questions, derivations, or timestamped notes.Sign in to comment
No comments on this lecture yet. Start the discussion above.