Optimization for the Information and Data Sciences

Graduate level course on convex optimization, first-order algorithms, and their applications in data science.

Course Description

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.

Course Details

  • Units: 4
  • Prerequisite: EE 441
  • Recommended Preparation: EE 503
  • Instruction Mode: Lecture, Discussion
  • Grading Option: Letter

Related Posts

The Fundamental Theorem of Linear Programming

A quick intuition and justification of why linear programming optima occur at extreme points.

optimization linear-programming convex-optimization

EE 588: Convex Sets

Foundational concepts of convex sets, including definitions, examples, and operations that preserve convexity.

optimization convex-analysis

Project Updates