Course Schedule and Catalog

Long Title: OPTIMIZATION: ALGORITHMS, COMPLEXITY, AND APPROXIMATIONS

Department: Computer Science

Grade Mode: Standard Letter

Language of Instruction: Taught in English

Course Type: Lecture

Credit Hours: 3

Description: The main focus of the course will be on smooth optimization techniques, with applications in machine learning and artificial intelligence. The course will introduce the basics of algorithms on continuous optimization, starting from the classical gradient descent algorithm in convex optimization, towards more sophisticated approaches in non-convex scenarios. The course will explore the fundamental theory, algorithms, complexity and approximations in nonlinear optimization. Graduate/Undergraduate Equivalency: COMP 414. Mutually Exclusive: Cannot register for COMP 514 if student has credit for COMP 414.