MATH 484 D13 - Nonlinear Programming
Iterative and analytical solutions of constrained and unconstrained problems of optimization; gradient and conjugate gradient solution methods; Newton's method, Lagrange multipliers, duality and the Kuhn-Tucker theorem; and quadratic, convex, and geometric programming. Course Information: 3 or 4 undergraduate hours. 3 or 4 graduate hours. 4 hours of credit requires approval of the instructor and department with completion of additional work of substance. Prerequisite: MATH 241; MATH 347 or MATH 348; or equivalent; MATH 415 or equivalent; or consent of instructor.
During early registration, this class is restricted to majors specifically requiring the course. Restrictions will be removed during business hours on December 10, 2020. Students not already in those majors are welcome to register as soon as the restrictions have been removed. Some seats are reserved for off-campus transfer students in majors requiring this course. Any remaining seats would be released on the Friday before spring classes begin. Note: Attendance may be required at the scheduled meeting times.
Option 1Number of Required Visit(s): 0
Course Level: Graduate