![CourseBuffet.com](/newdesign/img/logo-temp.png)
Introduction. Mathematical Background, including convex sets and functions. Need for constrained methods in solving constrained problems. Unconstrained optimization: Optimality conditions, Line Search Methods, Quasi-Newton Methods, Trust Region Methods. Conjugate Gradient Methods. Least Squares Problems.
Course Reviews