MAP6208

Download as PDF

Numerical Optimization

Long Description (Course Description)

Unconstrained and constrained optimization, linear and nonlinear programming, gradient, multiplier, and quasi-Newton methods. Penalty, multiplier, and projection methods for constrained problems.

Min Credits

3

Max Credits

3

Repeat for Credit

No

Total Credits Allowed

3

Grading Basis

GRD - Letter Grade