MATH 773 - Numerical Optimization

Credits: 3

This course will survey widely used methods for continuous optimization, focusing on both theoretical foundations and implementation using numerical software. Topics include linear programming (optimization of a linear function subject to linear constraints), line search and trust region methods for unconstrained optimization, and a selection of approaches (including active-set, sequential quadratic programming, and interior methods) for constrained optimization.

Check Course Availability

Print this Page