Class 8, C&O 367



  1. Geometric Programming
    1. primal and dual programs, Theorem 2.5.2
  2. Iterative Methods for Unconstrained Optimization (Chap. 3)
    1. Newton's method for solving a nonlinear system of equations (derivation, example)