ISyE Guest Lecturer: Yuri Nesterov
Second-order Methods with Provable Global Complexity
In this talk we discuss a recent progress in the general second-order minimization schemes related to the cubic regularization of the Newton's method. For convex case, we present an accelerated multistep version of the method. We consider the extensions of the new schemes onto constrained problems. Preliminary computational results are also discussed.