Optimization Bootcamp: Convex Optimization for ML & Control

An introductory overview of optimization, detailing its core concepts, diverse applications across machine learning and control, and the foundational structure for advanced study.

Dissecting the fundamental components of an optimization problem, exploring objective functions, constraints, and the implications of convexity on problem categories.

A high-level survey from the University of Washington on the diverse applications of optimization theory across modern machine learning, physics, and engineering disciplines.

A high-level overview of convexity, elucidating its fundamental intuitions, profound importance, and widespread applications across various optimization problems.

An introduction to convex sets, articulating their definition, essential properties, and applications within the broader context of mathematical optimization.

An explicit definition and exploration of convex functions, examining their fundamental properties, diverse examples, and implications for optimization problems.

Professor Steve Brunton proves the convexity of all norms, discussing its fundamental implications for optimization theory and machine learning algorithms.

An accessible yet rigorous exploration of Jensen's Inequality, providing both geometric intuition and a concrete application within probability theory, produced at the University of Washington.

Investigate the foundational principle in convex optimization: how convexity guarantees that any local minimum is inherently a global minimum, complete with a formal proof.