Fundamental algorithms and duality concepts of continuous optimization. Motivation, applicability, information requirements and computational cost of the algorithms is discussed. Practical problems will illustrate the power of continuous optimization techniques. Three lectures, one tutorial (one hour); first term Prerequisite(s): One of MATH 2A03, 2M06 (or 2M03 and 2MM3), 2Q04, or 2ZZ3 Cross-List(s): SFWR ENG 4TE3
