The alternating direction method of multipliers for finding the distance between ellipsoids

11/17/2020
by   M. V. Dolgopolik, et al.
0

We study several versions of the alternating direction method of multipliers (ADMM) for solving the convex problem of finding the distance between two ellipsoids and the nonconvex problem of finding the distance between the boundaries of two ellipsoids. In the convex case we present the ADMM with and without automatic penalty updates and demonstrate via numerical experiments on problems of various dimensions that our methods significantly outperform all other existing methods for finding the distance between ellipsoids. In the nonconvex case we propose a heuristic rule for updating the penalty parameter and a heuristic restarting procedure (a heuristic choice of a new starting for point for the second run of the algorithm). The restarting procedure was verified numerically with the use of a global method based on KKT optimality conditions. The results of numerical experiments on various test problems showed that this procedure always allows one find a globally optimal solution in the nonconvex case. Furthermore, the numerical experiments also demonstrated that our version of the ADMM significantly outperforms existing methods for finding the distance between the boundaries of ellipsoids on problems of moderate and high dimensions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2016

Stochastic Alternating Direction Method of Multipliers with Variance Reduction for Nonconvex Optimization

In the paper, we study the stochastic alternating direction method of mu...
research
08/04/2020

Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization

In this paper, we propose a faster stochastic alternating direction meth...
research
09/01/2017

Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems

In this paper, we consider solving a class of nonconvex and nonsmooth pr...
research
07/19/2020

Solving the Global Optimum of a Class of Minimization Problem

We study a special nonconvex optimization problem with a single spherica...
research
02/21/2018

Continuous Relaxation of MAP Inference: A Nonconvex Perspective

In this paper, we study a nonconvex continuous relaxation of MAP inferen...
research
08/28/2023

Partition-Insensitive Parallel ADMM Algorithm for High-dimensional Linear Models

The parallel alternating direction method of multipliers (ADMM) algorith...
research
02/23/2016

Learning Shapes by Convex Composition

We present a mathematical and algorithmic scheme for learning the princi...

Please sign up or login with your details

Forgot password? Click here to reset