EE 588 Optimization for the Information and Data Sciences
Units: 4 Convex sets, functions, and optimization problems. Basic convex analysis and theory of convex programming. Novel, efficient first-order algorithms. Applications in the information and data sciences. Prerequisite:EE 510 Recommended Preparation:EE 503 Instruction Mode: Lecture, Discussion Grading Option: Letter
You must be logged in to post a comment.