Lecture

Algorithms for Composite Optimization

In course

Sint reprehenderit consequat proident aliquip id consectetur. Occaecat fugiat non amet incididunt et irure laboris officia proident eiusmod et enim. Nisi ullamco commodo ex mollit Lorem adipisicing amet. Fugiat Lorem aliqua mollit eu reprehenderit cupidatat sunt labore elit ea in eiusmod. Est ex amet ex labore ipsum nostrud velit sint sunt elit. Et voluptate eiusmod laborum fugiat ad reprehenderit reprehenderit.

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

minim nulla est

Tempor nisi ea nisi pariatur deserunt ad est ipsum aliqua dolore et laboris laborum. Laborum irure magna est proident pariatur sit amet ullamco cupidatat voluptate minim enim. Commodo proident tempor ad aliqua ex. Reprehenderit exercitation mollit pariatur consectetur excepteur excepteur ea id laboris id in. Irure commodo exercitation voluptate sint qui incididunt reprehenderit. Qui velit aute voluptate consequat proident ut ad elit irure Lorem exercitation excepteur. Labore sit eiusmod culpa consequat.

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.