Jan 17, 2020  
2018-2019 Catalog 
    
2018-2019 Catalog [ARCHIVED CATALOG]

[Add to My Catalog]

EECS 260: Optimization


Units: 4

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.

Course Details
Repeatable for Credit: No
Laboratory included
Normal Letter Grade only

Requisites and Restrictions
Prerequisite: MATH 023 and MATH 024 and MATH 141
Instructor Permission Required: No


Fall 2019 course scheduling information

Spring 2020 course scheduling information




[Add to My Catalog]