Course Catalog - 2019-2020

     

COMP 414 - ALGORITHMS, COMPLEX. & APPROX

Long Title: OPTIMIZATION: ALGORITHMS, COMPLEXITY AND APPROXIMATIONS
Department: Computer Science
Grade Mode: Standard Letter
Course Type: Lecture
Credit Hours: 3
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
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 514. Mutually Exclusive: Cannot register for COMP 414 if student has credit for COMP 514.