|
Apr 25, 2024
|
|
|
|
2019-2020 Undergraduate Catalog [ARCHIVED CATALOG]
|
MATH 440 - Introductionto Optimization Theory3 Credits
Prerequisite(s): MATH 228 and MATH 232. This course offers an introduction to convex analysis, unconstrained optimization in n-dimensional Euclidean space, convex programming and duality. Analysis of two nonlinear algorithms will be studied: Newton’s method and the method of steepest descent.
|
|