02612 Constrained Optimization02612 Constrained Optimization is given in the spring semester every tuesday, 13:00-17:00. References and Books
LecturesLecture 01 - Introduction to Constrained OptimizationLecture 02 - Theory of Constrained Optimization - Optimality ConditionsLecture 03 - Theory of Constrained Optimization - SensitivityLecture 04 - Optimization AlgorithmsLecture 05 - Quadratic Programming (QP) - Active Set AlgorithmsLecture 06 - Quadratic Programming (QP) - Interior Point AlgorithmsLecture 07 - Linear Programming (LP)- Active Set AlgorithmsLecture 08 - Linear Programming (LP) - Interior Point AlgorithmsLecture 09 - Sequential Quadratic Programming (SQP) AlgorithmsLecture 10 - Sequential Quadratic Programming (SQP) AlgorithmsLecture 11 - Penalty and Augmented Lagrangian Methods & Interior Point Algorithms for Nonlinear ProgrammingLecture 12 - Conic Optimization - Second Order Cone Programming (SOCP) and Semi-Definite Programming (SDP)Lecture 13 - Applications of Constrained OptimizationAssignmentsAssignment 1 - Optimility Conditions, KKT Systems, and QP AlgorithmsAssignment 2 - LP Algorithms, SQP algorithms, and solution of NLPs |