Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Algorithms for Composite Optimization
Description
This lecture covers algorithms for composite optimization, focusing on proximal operators, proximal gradient methods, and linear minimization oracles. It discusses the design of algorithms for finding solutions, including quadratic majorizers and geometric illustrations. The lecture also delves into proximal-point operators, tractable prox-operators, and solution methods for composite convex minimization. Examples and theoretical bounds are provided for proximal-gradient algorithms and fast proximal-gradient schemes, showcasing their convergence and practical performance.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.