Inhalt: Unconstrained optimization: - optimality conditions - gradient related descent methods - line search algorithms - (nonlinear) conjugate gradient methods - quasi-Newton and Newton methods Box-constrained optimization: - optimality conditions - projected gradient and projected Newton schemes Nonlinear programs: - optimality conditions - penalty- and barrieer methods - sequential quadratic programming - quasi-Newton methods - line search and aspects of trust region globalization |
