Fundamental Barriers in Optimisation, Statistics, and Signal Processing

Add to your list(s) Download to your calendar using vCal

• Verner Vlacic (ETH)
• Thursday 12 December 2019, 15:00-16:00
• MR 14.

If you have a question about this talk, please contact Dr Hansen.

When solving optimisation problems such as linear programming (LP), semidefinite programming (SDP), basis pursuit (BP), LASSO , or training neural networks, we often discuss algorithms in terms of their ability to achieve an adequately small suboptimality of the objective function. In this talk we ask a different question: Do optimisation algorithms find good approximations to exact optima? We will see that the answer to this question is surprisingly nuanced, with implications for the theory of numerical condition and complexity theory.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• Interested Talks
• MR 14
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.