Tuning Over-Relaxed ADMM

03/10/2017
by   Guilherme França, et al.
0

The framework of Integral Quadratic Constraints (IQC) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to a semi-definite program (SDP). In the case of over-relaxed Alternating Direction Method of Multipliers (ADMM), an explicit and closed form solution to this SDP was derived in our recent work [1]. The purpose of this paper is twofold. First, we summarize these results. Second, we explore one of its consequences which allows us to obtain general and simple formulas for optimal parameter selection. These results are valid for arbitrary strongly convex objective functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2015

An Explicit Rate Bound for the Over-Relaxed ADMM

The framework of Integral Quadratic Constraints of Lessard et al. (2014)...
research
01/13/2018

An Explicit Convergence Rate for Nesterov's Method from SDP

The framework of Integral Quadratic Constraints (IQC) introduced by Less...
research
11/03/2012

Stochastic ADMM for Nonsmooth Optimization

We present a stochastic setting for optimization problems with nonsmooth...
research
04/10/2017

Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation

Many modern computer vision and machine learning applications rely on so...
research
10/02/2017

How is Distributed ADMM Affected by Network Topology?

When solving consensus optimization problems over a graph, there is ofte...
research
08/13/2018

Relax, and Accelerate: A Continuous Perspective on ADMM

The acceleration technique first introduced by Nesterov for gradient des...
research
09/18/2019

Renyi Differentially Private ADMM for Non-Smooth Regularized Optimization

In this paper we consider the problem of minimizing composite objective ...

Please sign up or login with your details

Forgot password? Click here to reset