Constrained Minimization
Numerical algorithms for unconstrained and constrained minimization: line searches, Newton and quasi-Newton steps, active-set and interior-point methods, and the KKT systems they solve. The theory is in the part of the same name of the course notes.