Faster Dynamic Matrix Inverse for Faster LPs

04/16/2020
by   Shunhua Jiang, et al.
0

Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an n× n real matrix under low-rank updates, with polynomially faster amortized running time. Our data structure is based on a recursive application of the Woodbury-Morrison identity for implementing cascading low-rank updates, combined with recent sketching technology. Our techniques and amortized analysis of multi-level partial updates, may be of broader interest to dynamic matrix problems. This data structure leads to the fastest known LP solver for general (dense) linear programs, improving the running time of the recent algorithms of (Cohen et al.'19, Lee et al.'19, Brand'20) from O^*(n^2+ max{1/6, ω-2, 1-α/2}) to O^*(n^2+max{1/18, ω-2, 1-α/2}), where ω and α are the fast matrix multiplication exponent and its dual. Hence, under the common belief that ω≈ 2 and α≈ 1, our LP solver runs in O^*(n^2.055) time instead of O^*(n^2.16).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2018

Error correction in fast matrix multiplication and inverse

We present new algorithms to detect and correct errors in the product of...
research
02/17/2022

A Faster Interior-Point Method for Sum-of-Squares Optimization

We present a faster interior-point method for optimizing sum-of-squares ...
research
10/26/2020

Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms

Many algorithms use data structures that maintain properties of matrices...
research
05/13/2019

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds

The dynamic matrix inverse problem is to maintain the inverse of a matri...
research
10/20/2022

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance

Projection maintenance is one of the core data structure tasks. Efficien...
research
04/04/2023

The Bit Complexity of Efficient Continuous Optimization

We analyze the bit complexity of efficient algorithms for fundamental op...
research
10/25/2019

A Deterministic Linear Program Solver in Current Matrix Multiplication Time

Interior point algorithms for solving linear programs have been studied ...

Please sign up or login with your details

Forgot password? Click here to reset