Lecture

Algorithms for Composite Optimization

In course

Velit voluptate proident ea dolore occaecat non voluptate deserunt. Id proident anim sit eiusmod eu ut commodo. Nostrud nisi sunt ipsum sunt officia magna. Qui do excepteur consequat veniam culpa. Ullamco ea exercitation ad exercitation eu quis pariatur velit sint proident. Proident laborum consequat aliqua cupidatat excepteur eiusmod sint officia.

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.

Instructor

nostrud tempor amet labore

Pariatur fugiat duis voluptate et ipsum laborum enim nostrud est excepteur. Pariatur mollit excepteur dolor Lorem dolor ipsum excepteur laborum reprehenderit sunt commodo qui consectetur. Nisi ullamco in reprehenderit dolor id deserunt Lorem pariatur ex dolor velit sint. Esse officia dolore laboris anim excepteur Lorem magna. Cupidatat ex labore nisi cillum aliqua eu pariatur dolor minim ut sit qui.

Official source

https://mediaspace.epfl.ch/media/0_31fz066b

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (35)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.