Log in with Facebook to participate in the Q&A.
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.
Take home exam and only 4 or 5 assignments... it is the epitome of birdiness
Added by Anonymous on 2013-05-20 17:04:31