Video: Frank E. Curtis, "Worst-Case Complexity Guarantees and Nonconvex Smooth Optimization"

Video From 17w5159: Beyond Convexity: Emerging Challenges in Data Science

Thursday, October 26, 2017 13:37 - 14:20

Worst-Case Complexity Guarantees and Nonconvex Smooth Optimization

Frank E. Curtis, Video: Worst-Case Complexity Guarantees and Nonconvex Smooth Optimization

Frank E. Curtis, Worst-Case Complexity Guarantees and Nonconvex Smooth Optimization, Beyond Convexity: Emerging Challenges in Data Science, BIRS, BIRS talk, 17w5159, math, mathematics, video

Banff International Research Station

presentation

mpeg4

188M

http://www.birs.ca/events/2017/5-day-workshops/17w5159/videos

http://www.birs.ca/events/2017/5-day-workshops/17w5159/videos/watch/201710261337-Curtis.html

Worst-Case Complexity Guarantees and Nonconvex Smooth Optimization

Frank E. Curtis at 17w5159: Beyond Convexity: Emerging Challenges in Data Science on Thursday, October 26, 2017

0 seconds of 0 secondsVolume 0%

00:00

Download this video (188M)