Search Calendar
Search
Print


Mathematics (MATH) Graduate Courses Listing - Continuous Optimization

Mathematics 5353 Continuous Optimization
Convexity. Mathematical programming including linear and nonlinear programming. Necessary conditions of the first and second orders. Optimization methods including descent methods, Newton and Quasi-Newton methods, feasible direction methods, penalty methods, and Lagrange methods.
Credit Weight: 0.5
Prerequisite(s): Permission of the Chair of the Department
Offering: 3-0; or 3-0