Units: 4 Topics include: Convex sets and functions; convex optimization problems; geometric and Lagrangian duality; simplex algorithm; ellipsoid algorithm and its implications; matroid theory; submodular optimization. Prerequisite:CSCI 570 or CSCI 670 Recommended Preparation: Mathematical maturity and a solid grounding in linear algebra Instruction Mode: Lecture Grading Option: Letter
You must be logged in to post a comment.