CSC 466H1
Numerical Methods for Optimization Problems
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.
Prerequisites & course information
Prerequisite: CSC336H1 / CSC338H5 / CSCC37H3 , MAT223H1 / MAT240H1 , MAT235H1 / MAT235Y1 / MAT237Y1 / MAT257Y1; Prerequisite:; Exclusion: NOTE: Students not enrolled in the Computer Science Major or Specialist program at A&S, UTM, or UTSC, or the Data Science Specialist at A&S, are limited to a maximum of 1.5 credits in 300-/400-level CSC/ECE courses.; Exclusion:
Sources
- Course catalogue ↗2026-2027