Course contents:

  • Elements of convex analysis
  • Lagrange duality
  • Convergence properties of algorithms
  • Gradient descent
  • Newton's method
  • Conjugate gradient
  • Trust-region
  • Interior-point methods
  • Basic derivative-free methods

The course is managed through Blackboard.