Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Every three years. 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. Note: This course assumes that students have the equivalent of graduate-level coursework addressing computational methods in nonlinear programming (e.g. MATH 6595).
Units: 3.0
Hours: 3 to 3