Files in This Item:
|Title:||Nonsmooth, Nonconvex Optimization|
|Group/Series/Folder:||Record Group 8.15 - Institute for Advanced Study|
Series 3 - Audio-visual Materials
|Notes:||IAS/Department of Mathematics Joint Seminar.|
Title from opening screen.
Abstract: There are many algorithms for minimization when the objective function is differentiable, convex, or has some other known structure, but few options when none of the above holds, particularly when the objective function is nonsmooth at minimizers, as is often the case in applications. The speaker will discuss two algorithms for minimization of nonsmooth, nonconvex functions. Gradient Sampling is a simple method that, although computationally intensive, has a nice convergence theory. The method is robust and the convergence theory has recently been extended to constrained problems. Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is a well-known method, developed for smooth problems, but which is remarkably effective for nonsmooth problems too. Although the theoretical results in the nonsmooth case are quite limited, the speaker and his research group have made some remarkable empirical observations and have had broad success in applications. Limited Memory BFGS is a popular extension for large problems, and it is also applicable to the nonsmooth case, although our experience with it is more mixed.
Prof Michael Overton from New York University discusses two algorithms: Gradient Sampling and Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm for minimization of nonsmooth, nonconvex functions.
Duration: 67 min.
|Appears in Series:||8.15:3 - Audio-visual Materials|
Videos for Public -- Distinguished Lectures