Mathematics (MATH) Courses>Nonlinear Programming

MATH447 - Nonlinear Programming

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Note(s)

  • 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

  • Complete all of the following
    • Complete 1 of:
      • MATH110 - Matrix Algebra for Engineers (1.5)
      • MATH211 - Matrix Algebra I (1.5)
    • Complete 1 of:

Course offered by

Department of Mathematics and Statistics

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.