Lecture

Primal-dual Optimization II

Description

This lecture delves into primal-dual optimization methods, focusing on Lagrangian approaches. It covers the Swiss army knife of convex formulations, real-world applications, and the translation of unconstrained problems into constrained ones. Various primal-dual methods are explored, including penalty and augmented Lagrangian methods, Arrow-Hurwitz's method variants, splitting techniques, and second-order decomposition methods. The lecture also discusses the quadratic penalty and Lagrangian formulations, e-accuracy in constrained optimization, and the behavior of the AL dual function. Examples such as blind image deconvolution, maximum-weight cut of a graph, clustering, and neural networks are presented to illustrate the concepts.

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.