Lecture

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems

Description

This lecture introduces a generalized optimistic framework for solving convex-concave saddle point problems, extending to higher-order methods. The method covers composite settings, complexity bounds, and line search schemes. The instructor discusses the convergence rates, stepsize selection, and the implementation of the algorithm.

Official source

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

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

Mathematics

Analysis: Numerical analysis

Mathematical logic: Set theory

Number theory: Number theory

Theoretical computer science

Programming language theory: High-level programming languages

Psychology

Basic psychology: Positive psychology

Related lectures (84)

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.