MATH6640
Download as PDF
Introduction to Optimization
Description
Existence, uniqueness and characterization of solutions to finite dimensional unconstrained and constrained optimization problems. Solution methods for finite dimensional unconstrained and constrained optimization problems. Newton and quasi-Newton methods. Globalization strategies, Linear Programming. Least Squares. Quadratic Programming. Convex Programming. Some programming experience is recommended. For graduate students extra work is required.
Minimum Credits
3
Maximum Credits
3
Repeat for Credit
No
Recommended Requisite(s):
Semesters Typically Offered
Fall