CO 466 Continuous OptimizationCombinatorics and Optimization (2009-2010)
Theory and practical algorithms for nonlinear continuous optimization. Fundamentals of unconstrained optimization: conjugate gradient methods and Newton-type methods. Nonlinear least squares problems. Fundamentals of constrained optimization: optimality conditions, quadratic programming, penalty and barrier methods, interior-point methods, sequential quadratic programming. [Offered: W]
Prerequisites: (CO 367/CM 442 and either CO 350 or CO 352/CM 340) or CO 355; Cumulative overall average of at least 80%; Not open to General Mathematics students
Sections For Fall 2009
CO 466 is not held in Fall 2009
Sections For Spring 2009
CO 466 is not held in Spring 2009