Course Outcomes
Algorithms for approximation and optimization
Algorithms for polynomial approximation and interpolation will be presented. Algorithms for optimization will be covered including those for unconstrained optimization, linear optimization, nonlinear constrained optimization, and convex optimization. Dynamic optimization and stochastic problems will also be covered. For a detailed description of desired learning outcomes visit the Math 322 Wiki page.
