ME-5584: Convex Optimization
Description: Recognizing and solving convex optimization problems. Convex sets, functions and optimization problems. Least-squares, linear, and quadratic optimization. Geometric and semidefinite programming. Vector optimization. Duality theory. Convex relaxations. Approximation, fitting, and statistical estimation. Geometric problems. Control and trajectory planning. Pre: Graduate standing.
Pathways: N/A
Course Hours: 3 credits
Sections Taught: 3
Average GPA: 3.29 (B+)
Strict A Rate (No A-) : 20.00%
Average Withdrawal Rate: 0.00%
| Mazen H Farhood | 2024 | 40.0% | 53.3% | 6.7% | 0.0% | 0.0% | 0.0% | 3.29 | 3 |