MATH 4133
Numerical Optimization
is numerical methods for functions of one variable, for functions of several variables including unrestricted search, sequential uniform search, irregular search, non-gradient methods, gradient methods with and without constraints, geometric programming, selection of other topics from dynamic programming, integer programming, etc., solution of applied problems by numerical optimization.
Prerequisites & course information
PR: MATH 3132
Sources
- Course catalogue ↗2026-2027