Lecture

Primal-dual Optimization: Extra-Gradient Method

Description

This lecture covers the Primal-dual optimization II focusing on the Extra-Gradient method, including SimGDA and AltGDA. It delves into nonconvex-concave problems, convergence rates, and practical performance. The lecture also discusses the Epilogue, practical implications, and the complexity of constrained min-max optimization. Various algorithms like Proximal Point, Extra-gradient, and Optimistic Gradient Descent Ascent are explored, along with their convergence properties. The lecture concludes with a discussion on the convergence of algorithms for smooth convex-concave minimax optimization and the challenges of nonsmooth, nonconvex optimization.

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.

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.