Convex Optimization Application Series

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing or maximizing convex functions over convex sets. Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.

This series by Dr. Ahmad Bazzi is for anyone who is interested to learn more on convex optimization. Just hit play and subscribe, the course is absolutely free.