 
Summary: Continuous Optimization
0. Introduction
1. Convex Analysis
2. Optimality conditions
3. Duality in Convex Optimization
4. Algorithms for unconstrained Optimization
5. Constrained Optimization
6. Relaxation of Integer programs
Version: 22092009 (Georg Still)
CO p 1
Script/book: (on internet)
http://wwwhome.math.utwente.nl/ stillgj/conopt/
We make use of
Script: de Klerk/Roos/Terlaky, Optimization
We refer to this script e.g. by [KRT, Th.4.3]
Book: Faigle/Kern/Still, Algorithmic principles of
Mathematical Programming.
on: http://wwwhome.math.utwente.nl/stillgj/priv/
We refer to this book e.g. by [FKS, Th.4.3]
Lecture sheets (on the homepage above)
