A Class of Linear Programs Solvable by Coordinate-wise Minimization

01/28/2020
by   Tomáš Dlask, et al.
0

Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima. We present a class of linear programs that coordinate-wise minimization solves exactly. We show that dual LP relaxations of several well-known combinatorial optimization problems are in this class and the method finds a global minimum with sufficient accuracy in reasonable runtimes. Moreover, for extensions of these problems that no longer are in this class the method yields reasonably good suboptima. Though the presented LP relaxations can be solved by more efficient methods (such as max-flow), our results are theoretically non-trivial and can lead to new large-scale optimization algorithms in the future.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2019

Relative Interior Rule in Block-Coordinate Minimization

(Block-)coordinate minimization is an iterative optimization method whic...
research
02/25/2017

Efficient coordinate-wise leading eigenvector computation

We develop and analyze efficient "coordinate-wise" methods for finding t...
research
09/14/2017

On Coordinate Minimization of Convex Piecewise-Affine Functions

A popular class of algorithms to optimize the dual LP relaxation of the ...
research
09/10/2012

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization

Stochastic Gradient Descent (SGD) has become popular for solving large s...
research
11/02/2021

Coordinate Linear Variance Reduction for Generalized Linear Programming

We study a class of generalized linear programs (GLP) in a large-scale s...
research
08/09/2018

Efficient Outlier Removal for Large Scale Global Structure-from-Motion

This work addresses the outlier removal problem in large-scale global st...
research
08/04/2020

Erratum: Fast and Simple Horizontal Coordinate Assignment

We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 20...

Please sign up or login with your details

Forgot password? Click here to reset