Efficient Inverse Maintenance and Faster Algorithms for Linear Programming
暂无分享,去创建一个
[1] Pravin M. Vaidya,et al. Speeding up Karmarkar's algorithm for multicommodity flows , 1996, Math. Program..
[2] David P. Woodruff,et al. Fast approximation of matrix coherence and statistical leverage , 2011, ICML.
[3] Yin Tat Lee,et al. A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[4] Richard Peng,et al. Uniform Sampling for Matrix Approximation , 2014, ITCS.
[5] Yurii Nesterov,et al. Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem , 1991, SIAM J. Optim..
[6] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[7] David P. Woodruff,et al. Low rank approximation and regression in input sparsity time , 2012, STOC '13.
[8] Yin Tat Lee,et al. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[9] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] Richard Peng,et al. $\ell_p$ Row Sampling by Lewis Weights , 2014, 1412.0588.
[11] Richard Peng,et al. Lp Row Sampling by Lewis Weights , 2015, STOC.
[12] Michael W. Mahoney. Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..
[13] S. Muthukrishnan,et al. Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods , 2006, APPROX-RANDOM.
[14] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[15] Aleksander Madry,et al. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.
[16] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[17] François Le Gall,et al. Powers of tensors and fast matrix multiplication , 2014, ISSAC.
[18] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[19] Santosh S. Vempala,et al. Recent Progress and Open Problems in Algorithmic Convex Geometry , 2010, FSTTCS.
[20] Huy L. Nguyen,et al. OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[21] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..
[22] Virginia Vassilevska Williams,et al. Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.
[23] P. Massart,et al. Adaptive estimation of a quadratic functional by model selection , 2000 .
[24] George Karakostas,et al. Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.
[25] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[26] Gary L. Miller,et al. Runtime guarantees for regression problems , 2011, ITCS '13.
[27] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[28] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[29] Hariharan Narayanan,et al. Random walks on polytopes and an affine interior point method for linear programming , 2009, STOC '09.
[30] Yin Tat Lee,et al. Path Finding II : An Õ(m sqrt(n)) Algorithm for the Minimum Cost Flow Problem , 2013 .
[31] Santosh S. Vempala,et al. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[32] Leonid Khachiyan,et al. Rounding of Polytopes in the Real Number Model of Computation , 1996, Math. Oper. Res..
[33] Gary L. Miller,et al. Iterative Row Sampling , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[34] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[35] Piyush Kumar,et al. Minimum-Volume Enclosing Ellipsoids and Core Sets , 2005 .