Linear and Convex Optimization
Course Code
CS2601
Session
Fall 2021
Instructor(s)
Kuan Yang, Assistant Professor (tenure-track)
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University
Description
This is an introductory course for convex and linear optimization. Topics include basics of mathematical optimization, convex sets and functions, convex and linear optimization problems, basic algorithms for convex optimization, Lagrange duality, optimality conditions for unconstrained and constrained optimizations.