Convex Optimization Problems: Standard Form

This lecture covers convex optimization problems in standard form, including transforming problems to the standard form, the convexity of optimization problems, and the optimality criterion for differentiable objectives. It also discusses equivalent optimization problems, local optima being global optima, and second-order cone programs. The instructor explains the grasping force optimization, project scheduling, Chebyshev center of a polyhedron, linear programs, transportation problems, quadratic programs, and quadratically constrained QPs.