On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.
Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.
Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Covers the concept of simplices in delta complexes and explains the standard n-simplex and the ordering of vertices.
Covers Bezier curves, de Casteljau Algorithm, properties, derivatives, splines, and end-points.
