Focuses primarily on the fundamental theory of nonlinear programming. Topics include convex analysis, optimality criteria, Lagrangian and conjugate duality, stability and sensitivity analysis. Other topics vary depending on the research interests of the instructor.Semester Hours: 3When Offered: Every three yearsPrerequisite: MATH 6595. Check for updates at courses.cudenver.edu.
This course information is from the 2009-2010 Downtown Campus Catalog. View this catalog.