Numerical Optimization Methods

Unconstrained nonlinear problems: basic properties of solutions and algorithms, global convergence, convergence rate, and complexity considerations. Constrained nonlinear problems: basic properties of solutions and algorithms. Primal, penalty and barrier, cutting plane, and dual methods. Computer implementations.

Units: 

4

Prerequisites: 

Matrix Analysis and Computation

Course Number: 

ECE271B