Title: Principled algorithms for finding local minimaSpeaker: Oliver Hinder Affiliation: Stanford University Room: MC 5501
Convex optimization is the cornerstone of continuous optimization, but many real problems are nonconvex: neural networks, airplane design, water network management, etc. This two part talk explores my work developing algorithms for finding local minima of nonconvex functions.
Title: Reading Seminar "Robust Optimization"Speaker: Group Reading Affiliation: University of Waterloo Room: MC 5479
In this reading seminar, we will go through Section 1. 2-1. 3 of Chapter 1 in the book 'Robust Optimization'