Adaptive Cubic Regularization Methods for Nonconvex Unconstrained Optimization
Adaptive cubic regularization methods have several favorable properties for nonconvex optimization. In particular, under mild assumptions, they are globally convergent to a second-order stationary point. In this talk, I will introduce an adaptive cubic regularization method for unconstrained optimization. Methods analogous to those used to solve the trust-region subproblem will be discussed for solving the local cubic model. Some numerical results will be presented that compare a cubic regularized Newton's method, a standard trust-region method and a trust-search method.
Tuesday, November 12, 2019
11:00AM AP&M 2402
Center for Computational Mathematics9500 Gilman Dr. #0112La Jolla, CA 92093-0112Tel: (858)534-9056