MATH7207 (Algorithms for Optimization) course reviews and ratings at Northeastern (NEU). Compare professors with RateMyProfessor reviews.
Covers algorithms used to solve optimization problems, specifically algorithms used to optimize a set of continuous design variables. Presents classic algorithms such as gradient descent, Newton’s method, simulated annealing, the simplex method, and others. Studies algorithms for both unconstrained and constrained optimization. Discusses optimization of both convex and nonconvex objective functions. Emphasizes hands-on and practical implementation of the algorithms presented by writing computer programs. Uses applications from business and industry to illustrate how the algorithms work and when they should be applied.
Data updated October 2026.