Explore cutting-edge developments in convex optimization through this 51-minute lecture by Yurii Nesterov from Université catholique de Louvain, Belgium. Delve into new perspectives on higher-order methods, gaining insights that can revolutionize approaches to complex optimization problems. Discover how these advanced techniques can enhance efficiency and accuracy in various mathematical and computational applications.
New Perspectives for Higher-order Methods in Convex Optimization
Institute for Mathematical Sciences via YouTube
Overview
Syllabus
New Perspectives for Higher-order Methods in Convex Optimization
Taught by
Institute for Mathematical Sciences
Related Courses
-
Inexact Accelerated High-order Proximal-point Methods in Convex Programming
-
Optimization: Higher-order Methods - Part 1
-
Optimization: Higher-order Methods - Part 2
-
Set-limited Functions and Polynomial-time Interior-point Methods
-
Optimization: First-order Methods - Part 2
-
Curiosities and Counterexamples in Smooth Convex Optimization
