Covers the fundamentals of optimization, from formulating a mathematical optimization problem from a problem description, to solving a mathematical optimization problem using numerical algorithms in optimization software, with an emphasis on convex optimization. The main topics include: linear algebra overview; convex sets and convex functions; convex optimization; duality theory and optimality criteria, Karush-Kuhn-Tucker conditions; reinforcement learning; unconstrained optimization algorithms: gradient method, Newton's method, quasi-Newton methods; constrained optimization algorithms: conditional gradient method, gradient projection method, alternating direction method of multipliers, interior point method, primal-dual method; stochastic gradient descent; distributed optimization; global search algorithms. Students will acquire not only theoretical knowledge of optimization, but also hands-on experience with optimization methods and software through assignments and a project.
1 term
Other grades
University of Maryland
ENAI 601 at UMD: average GPA 3.34 across 7 students. Grade distribution by term. Covers the fundamentals of optimization, from formulating a mathematical…
Average GPA: 3.34
Grade distribution records: 7 students across 1 terms.
| Grade | Students | Percent |
|---|---|---|
| A | 2 | 28.6% |
| A- | 1 | 14.3% |
| B | 1 | 14.3% |
| C | 1 | 14.3% |
| W | 2 | 28.6% |
Based on 7 student grade records across 1 term and 1 professor.
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades