CO 471 Semidefinite OptimizationCombinatorics and Optimization (2009-2010)
Optimization over convex sets described as the intersection of the set of symmetric, positive semidefinite matrices with affine spaces. Formulations of problems from combinatorial optimization, graph theory, number theory, probability and statistics, engineering design, and control theory. Theoretical and practical consequences of these formulations. Duality theory and algorithms.
Prerequisites: MATH 239 or 249, AMATH/PMATH 331 or PMATH 351, CO 355; Cumulative overall average of at least 80%; Not open to General Mathematics students
Sections For Fall 2009
CO 471 is not held in Fall 2009
Sections For Spring 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Tuncel, Levent | 10:00-11:20 M T W Th F | 6/10 | 1 | 1 | MC 4064 | 4302 | ||
| Held With: CO 671 | ||||||||