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
Lecture 04 
 10/18 (Fri.)Convex functionsLecture 05 
610/22 (Tue.)Convex functions (cont'd)Lecture 06 
710/29 (Tue.)Linear programmingLecture 07 
 11/01 (Fri.)LP duality and applicationsLecture 08 
811/05 (Tue.)Unconstrained optimization,
gradient descent method
Lecture 09 
911/12 (Tue.)Analysis of gradient descent,
smoothness and strong convexity
Lecture 10 
 11/15 (Fri.)Condition number, line searchLecture 11 
1011/19 (Tue.)Newton's methodLecture 12 
1111/26 (Tue.)Proximal gradient descentLecture 13 
 11/29 (Fri.)Lagrange multiplier methodLecture 14 
1212/03 (Tue.)Lagrange multiplier method (cont'd)  
1312/10 (Tue.)Newton's method and KKT systemLecture 15 
 12/13 (Fri.)KKT conditionLecture 16 
1412/17 (Tue.)Lagrangian and dual function  
1512/24 (Tue.)Dual problem and dualityLecture 19 
 12/27 (Fri.)Strong duality and Slater's condition  
1612/31 (Tue.)Projected gradient descent,
review and summary
Course summaryLecture 17
Lecture 18