Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Tight linear convergence rate bounds for Douglas-Rachford splitting and ADMM

In English

Författare

Summary, in English

Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) can be used to solve convex optimization problems that consist of a sum of two functions. Convergence rate estimates for these algorithms have received much attention lately. In particular, linear convergence rates have been shown by several authors under various assumptions. One such set of assumptions is strong convexity and smoothness of one of the functions in the minimization problem. The authors recently provided a linear convergence rate bound for such problems. In this paper, we show that this rate bound is tight for the class of problems under consideration.

Publiceringsår

2016-02-08

Språk

Engelska

Sidor

3305-3310

Publikation/Tidskrift/Serie

Proceedings of the IEEE Conference on Decision and Control

Volym

2016

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Mathematics

Conference name

54th IEEE Conference on Decision and Control, CDC 2015

Conference date

2015-12-15 - 2015-12-18

Conference place

Osaka, Japan

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 9781479978861