Mar 28, 2024  
2016-2017 Catalog 
    
2016-2017 Catalog [ARCHIVED CATALOG]

Add to My Catalog (opens a new window)

EECS 260: Optimization


[4 units]

Introduction of theory and numerical methods for continuous multivariate optimization (unconstrained and constrained), including: line-search and trust-region strategies; conjugate-gradient, Newton, quasi-Newton and large-scale methods; linear programming; quadratic programming; penalty and augmented Lagrangian methods; sequential quadratic programming; and interior-point methods.

Prerequisite: MATH 023  or MATH 024  or MATH 141 . Normal Letter Grade only. Laboratory included.


View course scheduling information




Add to My Catalog (opens a new window)