Difference between revisions of "Math 322: Algorithm Design and Optimization 2"
From MathWiki
(→Catalog Information) |
(→Prerequisites) |
||
| Line 19: | Line 19: | ||
=== Prerequisites === | === Prerequisites === | ||
| + | [[Math 320]]; concurrent with [[Math 346]], [[Math 323]] | ||
=== Minimal learning outcomes === | === Minimal learning outcomes === | ||
Revision as of 13:51, 6 June 2012
Contents
Catalog Information
Title
Computation and Optimization 2
(Credit Hours:Lecture Hours:Lab Hours)
(3:3:1)
Offered
W
Prerequisite
Math 320; concurrent with Math 346, Math 323
Description
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
Prerequisites
Math 320; concurrent with Math 346, Math 323
Minimal learning outcomes
Textbooks
Possible textbooks for this course include (but are not limited to):
