Iterative Methods Combinatorial Optimization And Linear Programming Beyond The Universal Barrier
Download Iterative Methods Combinatorial Optimization And Linear Programming Beyond The Universal Barrier full books in PDF, epub, and Kindle. Read online free Iterative Methods Combinatorial Optimization And Linear Programming Beyond The Universal Barrier ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Iterative Methods, Combinatorial Optimization, and Linear Programming Beyond the Universal Barrier
Author | : Aaron Daniel Sidford |
Publisher | : |
Total Pages | : 266 |
Release | : 2015 |
Genre | : |
ISBN | : |
Download Iterative Methods, Combinatorial Optimization, and Linear Programming Beyond the Universal Barrier Book in PDF, Epub and Kindle
In this thesis we consider fundamental problems in continuous and combinatorial optimization that occur pervasively in practice and show how to improve upon the best known theoretical running times for solving these problems across a broad range of parameters. Using and improving techniques from diverse disciplines including spectral graph theory, numerical analysis, data structures, and convex optimization we provide the first theoretical improvements in decades for multiple classic problems ranging from linear programming to linear system solving to maximum flow. Key results in this thesis include the following: -- Linear Programming: We provide the first general improvement to both the running time and convergence rate of polynomial time algorithms for solving linear programs in over 15 years. For a linear program with constraint matrix A, with z nonzero entries, and bit complexity L our algorithm runs in time [mathematical formula] -- Directed Maximum Flow: We provide an [mathematical formula] time algorithm for solving the-maximum flow problem on directed graphs with m edges, n vertices, and capacity ratio U improving upon the running time of [mathematical formula] achieved over 15 years ago by Goldberg and Rao. -- Undirected Approximate Flow: We provide one of the first almost linear time algorithms for approximately solving undirected maximum flow improving upon the previous fastest running time by a factor of [mathematical formula] for graphs with n vertices. -- Laplacian System Solvers: We improve upon the previous best known algorithms for solving Laplacian systems in standard unit cost RAM model, achieving a running time of [mathematical formula] for solving a Laplacian system of equations. -- Linear System Solvers: We obtain a faster asymptotic running time than conjugate gradient for solving a broad class of symmetric positive definite systems of equations. * More: We improve the running time for multiple problems including regression, generalized lossy flow, multicommodity flow, and more.
Iterative Methods, Combinatorial Optimization, and Linear Programming Beyond the Universal Barrier Related Books
Pages: 266
Pages: 255
Pages: 236
Pages: 782
Pages: 808