Convex sets and functions, optimality conditions in nonlinear programming, Lagrangian duality, quadratic programming algorithms for nonlinear programming including Newton's method, quasi-Newton methods, conjugate gradient methods, together with proofs of convergence.
Spring | Summer | Fall | ||
---|---|---|---|---|
(Session 1) | (Session 2) | |||
2023 |
Introduction To Optimization (4c)
|
|||
2022 |
Introduction To Optimization (4c)
|
|||
2021 |
Introduction To Optimization (4c)
|
|||
2020 |
Introduction To Optimization (4c)
|
Introduction To Optimization (4c)
|
||
2019 | ||||
2018 |
Introduction To Optimization (4c)
|
|||
2017 |
Nonlinear Programming (4c)
|
|||
2016 |
Nonlinear Programming (4c)
|
|||
2015 |
Nonlinear Programming (4c)
|
|||
2014 |
Nonlinear Programming (4c)
|
|||
2013 |
Nonlinear Programming (4c)
|
|||
2012 |
Nonlinear Programming (4c)
|
|||
2011 |
Nonlinear Programming (4c)
|
|||
2010 |
Nonlinear Programming (4c)
|
|||
2009 | ||||
2008 | ||||
2007 |