Speeding up Linear Programming using Randomized Linear Algebra

03/18/2020
by   Agniva Chowdhury, et al.
0

Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such as combinatorics. It is also used in many machine learning applications, such as ℓ_1-regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods (IPMs) are one of the most popular methods to solve LPs both in theory and in practice. Their underlying complexity is dominated by the cost of solving a system of linear equations at each iteration. In this paper, we consider infeasible IPMs for the special case where the number of variables is much larger than the number of constraints. Using tools from Randomized Linear Algebra, we present a preconditioning technique that, when combined with the Conjugate Gradient iterative solver, provably guarantees that infeasible IPM algorithms (suitably modified to account for the error incurred by the approximate solver), converge to a feasible, approximately optimal solution, without increasing their iteration complexity. Our empirical evaluations verify our theoretical results on both real-world and synthetic data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2022

Faster Randomized Interior Point Methods for Tall/Wide Linear Programs

Linear programming (LP) is an extremely useful tool which has been succe...
research
12/13/2017

Ellipsoid Method for Linear Programming made simple

In this paper, ellipsoid method for linear programming is derived using ...
research
07/17/2020

Initializing Successive Linear Programming Solver for ACOPF using Machine Learning

A Successive linear programming (SLP) approach is one of the favorable a...
research
03/24/2014

First Order Methods for Robust Non-negative Matrix Factorization for Large Scale Noisy Data

Nonnegative matrix factorization (NMF) has been shown to be identifiable...
research
06/18/2020

An Integer Linear Programming Framework for Mining Constraints from Data

Various structured output prediction problems (e.g., sequential tagging)...
research
12/08/2022

Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming

The 0-1 linear programming problem with nonnegative constraint matrix an...
research
04/30/2020

Physarum Powered Differentiable Linear Programming Layers and Applications

Consider a learning algorithm, which involves an internal call to an opt...

Please sign up or login with your details

Forgot password? Click here to reset