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:

Organized

9 responses

4.44

/ 5

strongly agree
56%
agree
33%
neither agree nor disagree
11%
disagree
0%
strongly disagree
0%
25%
50%
75%
100%

Clear Expectations

9 responses

3.89

/ 5

strongly agree
44%
agree
11%
neither agree nor disagree
33%
disagree
11%
strongly disagree
0%
25%
50%
75%
100%

Learned a Lot

9 responses

4.44

/ 5

strongly agree
56%
agree
33%
neither agree nor disagree
11%
disagree
0%
strongly disagree
0%
25%
50%
75%
100%

Fair Assessments

9 responses

4.44

/ 5

strongly agree
56%
agree
33%
neither agree nor disagree
11%
disagree
0%
strongly disagree
0%
25%
50%
75%
100%