CS2601: Linear and Convex Optimization

Shanghai Jiao Tong University, Fall 2023

 

Course Information

InstructorKuan Yang
Lecture timesFriday          16:00 - 17:40   (Week 1 - 16)
Wednesday 8:00 - 9:40      (Even weeks)
LocationUpper Hall 201 (上院 201)
Teaching assistant(s)Yao Xu (徐遥)
Office hoursTo be determined

 

News and Announcements

 

Textbook and References

 

Syllabus

1. Optimization
2. Linearity and affinity
3. Convexity
4. Linear optimization
5. Convex optimization

 

Lecture Schedule

WeekDateTopicsLecture notesHomework
109/15 (Fri.)Introductory examplesLecture 01 / pdf 
209/20 (Wed.)Optimality condition,
review of analysis
Lecture 02 / pdf 
 09/22 (Fri.)Affinity (linearity) and convexityLecture 03 / pdfHW1
410/08 (Fri.)Separating hyperplane theorem,
supporting hyperplane theorem
  
510/13 (Fri.)Convex functions  
610/18 (Wed.)Convex functions (cont'd)  
 10/20 (Fri.)Linear programming  
710/27 (Fri.)LP duality and applications  
811/01 (Wed.)Unconstrained optimization,
gradient descent method
  
 11/03 (Fri.)Analysis of gradient descent,
smoothness and strong convexity
  
911/10 (Fri.)Condition number, line search  
1011/15 (Wed.)Newton's method  
 11/17 (Fri.)Proximal gradient descent  
1111/24 (Fri.)Lagrange multiplier method  
1211/29 (Wed.)Lagrange multiplier method (cont'd)  
 12/01 (Fri.)Newton's method and KKT system  
1312/08 (Fri.)KKT condition  
1412/13 (Wed.)Lagrangian and dual function  
 12/15 (Fri.)Dual problem and duality  
1512/22 (Fri.)Strong duality and Slater's condition  
1612/27 (Wed.)Projected gradient descent  
 12/29 (Fri.)Review and summaryCourse summary