Read our cookies policy and privacy statement for more information.
×Dekalb, Illinois
Theory and algorithms for optimization of nonlinear programs. Convex sets and functions, necessary and sufficient optimality conditions, constraint qualifications, duality theory, algorithms for quadratic programming, and linear complementary problems. Methods of direct search, Newton, gradient projection, feasible direction, and reduced gradient
Units: 3.0