Ã山ǿ¼é

Overview

Mathematics & Statistics (Sci) : Optimization terminology. Convexity. First- and second-order optimality conditions for unconstrained problems. Numerical methods for unconstrained optimization: Gradient methods, Newton-type methods, conjugate gradient methods, trust-region methods. Least squares problems (linear + nonlinear). Optimality conditions for smooth constrained optimization problems (KKT theory). Lagrangian duality. Augmented Lagrangian methods. Active-set method for quadratic programming. SQP methods.

Terms: This course is not scheduled for the 2022-2023 academic year.

Instructors: There are no professors associated with this course for the 2022-2023 academic year.

• Prerequisites: MATH 223 or MATH 247 or MATH 236 or MATH 251. MATH 248 or MATH 314 or MATH 358. MATH 243 or MATH 255.

• Not open to students who have taken MATH 560.