A gentle and visual introduction to the topic of Convex Optimization. (1/3) This video is the first of a series of three. The plan is as follows: Part 1: What is (Mathematical) Optimization? ( ) Part 2: Convexity and the Principle of (Lagrangian) Duality ( ) Part 3: Algorithms for Convex Optimization (Interior Point Methods). ( ) ------------------------------- Typos: - 8:34, The matrix A should be of size nxm, and the vector b should be of size 1xm. -------------------------------- Timestamps: 0:00 Intro 2:50 What is optimization? 06:00 Linear programs 8:19 Linear regression 9:32 (Markovitz) Portfolio optimization 10:00 Conclusion -------------------------- Credit: 🐍 Manim and Python : 🐵 Blender3D: 🗒️ Emacs: This video would not have been possible without the help of Gökçe Dayanıklı. -------------------------- Music Sneaky Snitch by Kevin MacLeod Link: License: Carefree by Kevin MacLeod Link: License: Funkorama by Kevin MacLeod Link: License: