MATH 447

Nonlinear Programming

Units: 1.5

Hours: 3-0-0

Introduction to theory and algorithm of nonlinear programming. Topics may include: unconstrained optimization theory and iterative methods; Lagrange multipliers and Karush-Kuhn-Tucker theorem for constrained optimization problems; convex programming and duality, penalty function methods.

Note:

  • Credit will be granted for only one of MATH 447, MATH 491A (if taken in the same topic), MATH 492 (if taken in the same topic).

Prerequisites:

Undergraduate course in Mathematics offered by the Department of Mathematics and Statistics in the Faculty of Science.

Schedules:
Summer 2018 Fall 2018 Spring 2019

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.