ENEE662

Convex Optimization

Reviews for this course Testudo

Recommended: MATH410. Credit only granted for: ENEE759F or ENEE662. Focuses on recognizing, solving, and analyzing convex optimization problems. Convex sets, convex functions, convex and quasi-convex optimization problems. Duality theory and optimality conditions. Specific classes of problems including linear optimization (LP), semi-definite optimization (SDP), geometric programming. Algorithms for unconstrained and constrained optimization; interior-point methods. Applications in controls, communications, signal processing, statistics, and other areas.

Fall 2024

Nuno Martins

9 reviews
Average rating: 2.33

Past Semesters

Michael Rotkowitz

0 reviews
Average rating: N/A

Richard La

14 reviews
Average rating: 2.93

John Baras

3 reviews
Average rating: 1.00

Nuno Martins

9 reviews
Average rating: 2.33

Sennur Ulukus

5 reviews
Average rating: 3.80

Nuno Martins

9 reviews
Average rating: 2.33

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.