IE 3053 - GLOBAL OPTIMIZATION

Minimum Credits: 3
Maximum Credits: 3
This is an introductory course to the theory and applications of global optimization. The topics covered in this course include properties of convex/non-convex sets and functions, convex envelopes, duality, local and global optimality conditions, algorithms and their convergence and finiteness, computational complexity of global optimization, cutting planes, outer approximation, convexification, decomposition, branch and bound, DC Programming, Lipschitzian programming.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad Letter Grade
Course Requirements: PROG: Swanson School of Engineering

Click here for class schedule information.

Add to Portfolio.

Close Window