Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Introduces fundamental algorithms and theory for nonlinear optimization problems. Topics include Newton, quasi-Newton and conjugate directional methods; line search and trust-region methods; active set, penalty and barrier methods for constrained optimization; convergence analysis and duality theory
Units: 3.0
Hours: 3 to 3