 |
Center for Nonlinear Studies |
This short series of lectures gives an overview of the most-commonly used numerical algorithms for unconstrained and constrained optimization over continuous variables. This includes line-search and trust-region methods, quasi-Newton methods, active-sets method for quadratic programming, sequential-quadratic programming, and interior point methods. The goal is to give some intuitive understanding of the methods without diving deep into theory.
Host: CNLS