Daily Log
Daily topics and PDFs (handouts and worksheets) will appear here as they occur. You do not have to turn-in any handout or worksheet! Note that the recorded lectures are in Announcements at canvas.alaska.edu/courses/21663.
- Friday 6 December: section 16.7 (POPDIP)
PDF slides: POPDIP slides - Wednesday 4 December: section 15.4, 14.5 (active set method, KKT)
handout: KKT conditions in general (PDF) - Monday 2 December: section 14.4 (linear inequality constraints)
- Monday 25 November: section 14.2, 14.3 (linear equality constraints)
- Friday 22 November: unconstrained ideas; section 14.2 (optimality conditions)
- Wednesday 20 November: section 12.3 (quasi-Newton)
- Monday 18 November: section 12.2 (steepest descent on quadratics)
- Friday 15 November: theorem 11.7
- Wednesday 13 November: section 11.5 (line search)
- Monday 11 November: section 11.4 (guaranteeing descent)
- Friday 8 November: cont.
- Wednesday 6 November: section 11.3 (Newton's method for optimization)
- Monday 4 November: steepest descent
PDF slides: Steepest descent needs help - Friday 1 November: section 11.1, 11.2 (unconstrained optimization)
- Wednesday 30 October: section 2.7 (Newton's method)
- Monday 28 October: duality
- Friday 25 October: section 6.1, 6.2 (duality)
- Wednesday 23 October: section 9.1--9.3 (Klee-Minty example)
- Monday 21 October: simplex method
- Friday 18 October: Midterm Exam
see Exams tab for Review Guide PDF
handout: page number "solutions" for Review Guide (PDF) - Wednesday 16 October: simplex method
handout: simplex method template (PDF) - Monday 14 October: section 5.2 (simplex method)
- Friday 11 October: representation and optimality
- Wednesday 9 October: section 4.4 (representation and optimality)
- Monday 7 October: section 4.3 (extreme points same as BFS)
- Friday 4 October: standard form
- Wednesday 2 October: section 4.2 (standard form)
- Monday 30 September: section 4.1 (visualizable linear programming)
- Friday 27 September: section 3.3 (null space matrices)
- Wednesday 25 September: section 3.2 (null spaces etc.)
- Monday 23 September: linear constraints
- Friday 20 September: section 3.1 (linear constraints; feasible directions)
- Wednesday 18 September: section 2.4 (general optimization algorithm)
- Monday 16 September: section 2.6 (Taylor series); see Canvas page for zoom recording
PDF slides: section 2.6 - Friday 13 September: convexity finished; descent directions
- Wednesday 11 September: convexity and first derivatives
- Monday 9 September: convexity: local gives global
- Friday 6 September: section 2.3 (convexity)
- Wednesday 4 September: section 2.2 (language)
- Monday 2 September: Labor Day, no class
- Friday 30 August: "5 examples", and start Chapter 2
- Wednesday 28 August: "5 examples"
- Monday 26 August: examples (like in Chapter 1)
handout: 5 example optimization problems (PDF)