Introduction to Convex Optimization

10-425 + 10-625, Fall 2023
School of Computer Science
Carnegie Mellon University


Frequently Asked Questions

Q: How does 10-425/625 differ from 10-725 (i.e. the PhD-level convexopt)?

A: 10-725 is the PhD-level Convex Optimization course offered by the Machine Learning Department. It focuses heavily on the theory and analysis of optimization and is, naturally, proof oriented. 10-425/625 will focus more on the practical aspects of implementing optimization algorithms and understanding their behavior on real world problems than 10-725. That said, 10-425/625 won’t shy away from proving convergence properties and analyzing the performance of optimization algorithms, but when it is the focus of the course we will scaffold the necessary math background (or refresh the necessary prerequisites).

Q: How does 10-425 differ from 10-625?

A: Students in 10-625 will complete an additional homework assignment (HW625). Students in 10-425 will not. Undergraduates may register for either 10-425 or 10-625, depending on their preference.

Q: I just found this website, what should I do next?

A: Please read through this FAQ and the Syllabus page. If you are registered (or waitlisted) for the course, the course staff will enroll you in the technologies we will use for communication (Piazza) and homework assignment submission (Gradescope). If it is after the first day of class, you have been registered for more than two days, and you still don’t have access to one of these, then go ahead and enroll yourself in Piazza using your Andrew Email and send a “Private Note” to the instructors that includes your Andrew ID.

Q: Will I be able to get off the waitlist?

A: Of course, we can never guarantee that you will be able to get off the waitlist. However, the waitlist often clears several weeks into the semester. If you submit all the homeworks and keep up with the work, there is a reasonable chance you’ll be able to get in.