MAT 4387 Optimization: Theory and Practice

3 units
Mathematics
Faculty of Science
Optimization problems, nonlinear programming, unconstrained optimization, convexity and coercivity, existence theory, gradient and Newton methods constrained optimization, gradient method with projection, Kuhn-Tucker relations, duality, Uzawa method. Linear programming, simplex method.

Components:

Lecture

Requirements:

Prerequisites: (MAT 2120, MAT 2121) or ( MAT 2122 , MAT 2125 ) or (MAT 2120, MAT 2322 ), ( MAT 2324 or MAT 2384 ).

Previously Offered Terms:

Winter

French Equivalent:

MAT 4787
GradesEvaluations
All Professors
C+ Average (4.909)
Most Common: C+ (18%)
33 students

P

S

NS

F

D

C

B

A-

A+

Yves Bourgault

2 sections from Winter 2019 to Winter 2023

C+ Average (4.909)
Most Common: C+ (18%)
33 students

P

S

NS

F

D

C

B

A-

A+