*****COURSES ARE SUBJECT TO CHANGE*****
Introduces numerical optimization tools widely used in engineering, science, and economics. Topics include: line-search and trust-region methods for unconstrained optimization, fundamental theory of constrained optimization, simplex and interior-point methods for linear programming, and computational algorithms for nonlinear programming. Basic knowledge of linear algebra is assumed. Enrollment is restricted to graduate students.
5 Credits
Year | Fall | Winter | Spring | Summer |
---|---|---|---|---|
2018-19 |
| |||
2017-18 |
| |||
2016-17 |
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.