A Deterministic Linear Program Solver in Current Matrix Multiplication Time

10/25/2019
by   Jan van den Brand, et al.
0

Interior point algorithms for solving linear programs have been studied extensively for a long time [e.g. Karmarkar 1984; Lee, Sidford FOCS'14; Cohen, Lee, Song STOC'19]. For linear programs of the form min_Ax=b, x > 0 c^ x with n variables and d constraints, the generic case d = Ω(n) has recently been settled by Cohen, Lee and Song [STOC'19]. Their algorithm can solve linear programs in Õ(n^ωlog(n/δ)) expected time, where δ is the relative accuracy. This is essentially optimal as all known linear system solvers require up to O(n^ω) time for solving Ax = b. However, for the case of deterministic solvers, the best upper bound is Vaidya's 30 years old O(n^2.5log(n/δ)) bound [FOCS'89]. In this paper we show that one can also settle the deterministic setting by derandomizing Cohen et al.'s Õ(n^ωlog(n/δ)) time algorithm. This allows for a strict Õ(n^ωlog(n/δ)) time bound, instead of an expected one, and a simplified analysis, reducing the length of their proof of their central path method by roughly half. Derandomizing this algorithm was also an open question asked in Song's PhD Thesis. The main tool to achieve our result is a new data-structure that can maintain the solution to a linear system in subquadratic time. More accurately we are able to maintain √(U)A^(AUA^)^-1A√(U) v in subquadratic time under ℓ_2 multiplicative changes to the diagonal matrix U and the vector v. This type of change is common for interior point algorithms. Previous algorithms [e.g. Vaidya STOC'89; Lee, Sidford FOCS'15; Cohen, Lee, Song STOC'19] required Ω(n^2) time for this task. [...]

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/18/2018

Solving Linear Programs in the Current Matrix Multiplication Time

This paper shows how to solve linear programs of the form _Ax=b,x≥0 c^ x...
research
05/11/2019

Solving Empirical Risk Minimization in the Current Matrix Multiplication Time

Many convex problems in machine learning and computer science share the ...
research
02/06/2020

Solving Tall Dense Linear Programs in Nearly Linear Time

In this paper we provide an Õ(nd+d^3) time randomized algorithm for solv...
research
08/28/2019

Revisiting a Cutting Plane Method for Perfect Matchings

In 2016, Chandrasekaran, Végh, and Vempala published a method to solve t...
research
04/16/2020

Faster Dynamic Matrix Inverse for Faster LPs

Motivated by recent Linear Programming solvers, we design dynamic data s...
research
02/26/2021

An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons

Given a set S of m point sites in a simple polygon P of n vertices, we c...
research
06/25/2021

𝒩IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs

Hierarchical least-squares programs with linear constraints (HLSP) are a...

Please sign up or login with your details

Forgot password? Click here to reset