Convex optimization algorithms and their applications to efficiently solving fundamental computational problems. Intended audience is advanced undergraduates and master students. Topics include modeling using mathematical programs, gradient descent algorithms, linear programming, Lagrangian duality, basics of complexity theory for optimization.