CS2601: Linear and Convex Optimization

Shanghai Jiao Tong University, Fall 2024

 

Course Information

InstructorKuan Yang
Lecture timesFriday    16:00 - 17:40   (Odd weeks)
Tuesday 8:00 - 9:40     (Week 1 - 16)
LocationMiddle Hall 213 (中院 213)
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/20 (Fri.)Introductory examplesLecture 01 / pdf 
209/24 (Tue.)Optimality condition,
review of analysis
Lecture 02 / pdf 
410/08 (Tue.)Affinity (linearity) and convexityLecture 03 / pdfHW1
510/15 (Tue.)Separating hyperplane theorem,
supporting hyperplane theorem
  
 10/18 (Fri.)Convex functions  
610/22 (Tue.)Convex functions (cont'd)  
710/29 (Tue.)Linear programming  
 11/01 (Fri.)LP duality and applications  
811/05 (Tue.)Unconstrained optimization,
gradient descent method
  
911/12 (Tue.)Analysis of gradient descent,
smoothness and strong convexity
  
 11/15 (Fri.)Condition number, line search  
1011/19 (Tue.)Newton's method  
1111/26 (Tue.)Proximal gradient descent  
 11/29 (Fri.)Lagrange multiplier method  
1212/03 (Tue.)Lagrange multiplier method (cont'd)  
1312/10 (Tue.)Newton's method and KKT system  
 12/13 (Fri.)KKT condition  
1412/17 (Tue.)Lagrangian and dual function  
1512/24 (Tue.)Dual problem and duality  
 12/27 (Fri.)Strong duality and Slater's condition  
1612/31 (Tue.)Projected gradient descent,
review and summary
Course summary