Difference between revisions of "Math 322: Algorithm Design and Optimization 2"

From MathWiki
Jump to: navigation, search
(Created page with "== Catalog Information == === Title === === (Credit Hours:Lecture Hours:Lab Hours) === === Offered === === Prerequisite === === Description === == Desired Learning Outcomes...")
 
(Catalog Information)
Line 2: Line 2:
  
 
=== Title ===
 
=== Title ===
 +
Computation and Optimization 2
  
 
=== (Credit Hours:Lecture Hours:Lab Hours) ===
 
=== (Credit Hours:Lecture Hours:Lab Hours) ===
 +
(3:3:1)
  
 
=== Offered ===
 
=== Offered ===
 +
W
  
 
=== Prerequisite ===
 
=== Prerequisite ===
 +
[[Math 320]]; concurrent with [[Math 346]], [[Math 323]]
  
 
=== Description ===
 
=== 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 ==
 
== Desired Learning Outcomes ==

Revision as of 12:51, 6 June 2012

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

Minimal learning outcomes

Textbooks

Possible textbooks for this course include (but are not limited to):

Additional topics

Courses for which this course is prerequisite