CSC466H1: Numerical Methods for Optimization Problems

Hours: 
36L

Numerical methods for unconstrained optimization problems, in particular line search methods and trust region methods. Topics include steepest descent, Newton's method, quasi-Newton methods, conjugate gradient methods and techniques for large problems. This course will normally be offered every other year.

Prerequisite: 
Exclusion: 

NOTE: Students not enrolled in the Computer Science Major or Specialist program at the UTSG, UTM, or UTSC are limited to a maximum of three 300-/400-level CSC/ECE half-courses.

Distribution Requirements: 
Science
Breadth Requirements: 
The Physical and Mathematical Universes (5)