Course Schedule and Catalog
Course Schedule - Spring Semester 2025
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
COMP 414 001 (CRN: 25751)
ALGORITHMS, COMPLEX. & APPROX
Long Title: OPTIMIZATION: ALGORITHMS, COMPLEXITY AND APPROXIMATIONS
Department: Computer Science
Instructor: Kyrillidis, Tasos
Meeting: 11:00AM - 11:50AM MWF (13-JAN-2025 - 25-APR-2025)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Language of Instruction: Taught in English
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
Course Materials: Rice Campus Store
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Prerequisites: (ELEC 303 OR STAT 310 OR ECON 307 OR STAT 312 OR STAT 315 OR DSCI 301 OR STAT 311) AND (CMOR 302 OR CMOR 303 OR MATH 354 OR MATH 355)
Section Max Enrollment: 50
Section Enrolled: 0
Total Cross-list Max Enrollment: 50
Total Cross-list Enrolled: 0
Enrollment data as of: 14-NOV-2024 12:03PM
Final Exam: Scheduled Final Exam-OTR Room
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. Cross-list: COMP 514. Mutually Exclusive: Cannot register for COMP 414 if student has credit for COMP 514.