Math 322: Algorithm Design and Optimization 2
Computation and Optimization 2
(Credit Hours:Lecture Hours:Lab Hours)
A treatment of algorithms used to solve dynamic programming problems and advanced computing problems. Specific topics include finite-horizon and infinite-horizon dynamic programming, discrete transforms, compressed sensing, heuristics, branch and bound, conditioning and stability.
Desired Learning Outcomes
Minimal learning outcomes
Possible textbooks for this course include (but are not limited to):