| 1 |
1 Problem Formulation in Optimization,
2 Necessary and Sufficient Conditions for Minimality for Unconstrained Optimization Problems,
3 Convex Sets, Lagrange Multipliers
4 Kuhn-Tucker Conditions, Numerical Solutions,
5 Sensivity Analysis, Simplex Method
6 Simplex Method
7 //2009 MIDTERM
8 The Golden Section Method,
Fibonachi Method,
9 The Steepest Descent Method, Newton's Method
10 Expanding Subspace Theorem, The Fletcher aand Reeves Method,
11 Quasi Newton and Conjugate Direction Method,
12 Davidon Fletcher Powel Method
13 Constrained Optimization
14
Homework presentations |