![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > CCIMI Short course: First-order methods for large scale optimisation problems > First-order methods for large scale optimisation problems - Convex analysis
![]() First-order methods for large scale optimisation problems - Convex analysisAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Rachel Furner. Part of the CCIMI short course ‘First-order methods for large scale optimisation problems’ Instructor: Stephen Becker, University of Colorado Lecture 1: Convex analysis We introduce optimization with a few examples, and classify problems and discuss oracle models, then discuss convexity and differentiability. Basic analysis concepts will be reviewed as needed. Topics include: types of convexity, proximity operators, Fenchel-Legendre conjugates, convex relaxations, Moreau envelope, subgradients, Lipschitz continuity, and fundamental inequalities. There will be an interlude on programming using cvx or cvxpy (Matlab or Python, respectively) and verifying gradients, so bring a laptop. This talk is part of the CCIMI Short course: First-order methods for large scale optimisation problems series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsAdaptation to climate change seminar series tate modern StatsOther talksOpening Flies’ Ears and Head-Heart West Midland Railway with Jan Chaudhry Admissions and early intervention: insights from newer approaches Environmental shocks and demographic consequences in England: 1280-1325 and 1580-1640 compared Linguistics and education: a case of mutual dependency? |