Fetching the paper…
Reading the bibliography…
Extremum problems with inequalities as subsidiary conditions, studies and essays presented to r. courant on his 60th birthday, january 8, 1948, 1948
Fritz John · 1948
Earlier work this paper cites.
Maximization of a linear function of variables subject to linear inequalities
George B Dantzig · 1951
Earlier work this paper cites.
Optimal and efficient designs of experiments
Corwin L Atwood · 1969
Earlier work this paper cites.
A polynomial algorithm in linear programming
Leonid Genrikhovich Khachiyan · 1979
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · 1984
Earlier work this paper cites.
An algorithm for linear programming which requires o (((m+ n) n 2+(m+ n) 1.5 n) l) arithmetic operations
Pravin M Vaidya · 1987
Earlier work this paper cites.
A polynomial-time algorithm, based on newton’s method, for linear programming
James Renegar · 1988
Earlier work this paper cites.
Approximation of zonoids by zonotopes
Jean Bourgain, Joram Lindenstrauss, and Vitali Milman · 1989
Earlier work this paper cites.
Speeding-up linear programming using fast matrix multiplication
Pravin M Vaidya · 1989
Earlier work this paper cites.
Volume ratios and a reverse isoperimetric inequality
Keith Ball · 1991
Earlier work this paper cites.
The brunn-minkowski-firey theory. i. mixed volumes and the minkowski problem
Erwin Lutwak · 1993
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
Rounding of polytopes in the real number model of computation
Leonid G Khachiyan · 1996
Earlier work this paper cites.
An extremal property of the mean width of the simplex
Franck Barthe · 1998
Earlier work this paper cites.
Convex geometry and functional analysis
Keith Ball · 2001
Earlier work this paper cites.
Computation of minimum-volume covering ellipsoids
Peng Sun and Robert M Freund · 2004
Earlier work this paper cites.
Minimum-volume enclosing ellipsoids and core sets
Piyush Kumar and E Alper Yildirim · 2005
Earlier work this paper cites.
John ellipsoids
Erwin Lutwak, Deane Yang, and Gaoyong Zhang · 2005
Earlier work this paper cites.
Geometric random walks: a survey
Santosh Vempala · 2005
Earlier work this paper cites.
Linear convergence of a modified frank–wolfe algorithm for computing minimum-volume enclosing ellipsoids
S Damla Ahipasaoglu, Peng Sun, and Michael J Todd · 2008
Earlier work this paper cites.
Faster approximate lossy generalized flow via interior point algorithms
Samuel I Daitch and Daniel A Spielman · 2008
Earlier work this paper cites.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2008
Earlier work this paper cites.
Speedup via quantum sampling
Pawel Wocjan and Anura Abeyesinghe · 2008
Earlier work this paper cites.
Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck, Nicolo Cesa-Bianchi, and Sham M Kakade · 2012
Earlier work this paper cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, and David P Woodruff · 2012
Earlier work this paper cites.
Multiplying matrices faster than coppersmith-winograd
Virginia Vassilevska Williams · 2012
Earlier work this paper cites.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Earlier work this paper cites.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L Nguyên · 2013
Earlier work this paper cites.
The geometry of differential privacy: the sparse and approximate cases
Aleksandar Nikolov, Kunal Talwar, and Li Zhang · 2013
Earlier work this paper cites.
Optimal cur matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
Earlier work this paper cites.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Earlier work this paper cites.
Quantum algorithms for linear algebra and machine learning
Anupam Prakash · 2014
Cited alongside, same era.
Sketching as a tool for numerical linear algebra
David P Woodruff · 2014
Cited alongside, same era.
Orlicz–john ellipsoids
Du Zou and Ge Xiong · 2014
Cited alongside, same era.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Cited alongside, same era.
Lp row sampling by lewis weights
Michael B Cohen and Richard Peng · 2015
Cited alongside, same era.
Quantum speedup of monte carlo methods
Ashley Montanaro · 2015
Cited alongside, same era.
Volumetric spanners: an efficient exploration basis for learning
Breaking the n-pass barrier: A streaming algorithm for maximum weight bipartite matching
S Cliff Liu, Zhao Song, and Hengjie Zhang · 2020
Later among the works it cites.
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021
Later among the works it cites.
Quantum algorithms and lower bounds for linear regression with norm constraints
Yanlin Chen and Ronald de Wolf · 2021
Later among the works it cites.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2021
Later among the works it cites.
A faster algorithm for solving general lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Elad Hazan and Zohar Karnin · 2016
Cited alongside, same era.
Computing maximum flow with augmenting electrical flows
Aleksander Madry · 2016
Cited alongside, same era.
Minimum-volume ellipsoids: Theory and algorithms
Michael J Todd · 2016
Cited alongside, same era.
Near-optimal design of experiments via regret minimization
Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, and Yining Wang · 2017
Cited alongside, same era.
Quantum speed-ups for solving semidefinite programs
Fernando GSL Brandao and Krysta M Svore · 2017
Cited alongside, same era.
Low-rank approximation and regression in input sparsity time
Kenneth L Clarkson and David P Woodruff · 2017
Cited alongside, same era.
Fast sketching of polynomial kernels of polynomial degree
Zhao Song, David Woodruff, Zheng Yu, and Lichen Zhang · 2021
Later among the works it cites.
Oblivious sketching-based central path method for linear programming
Zhao Song and Zheng Yu · 2021
Later among the works it cites.
Quantum sampling algorithms, phase transitions, and computational complexity
Dominik S Wild, Dries Sels, Hannes Pichler, Cristian Zanoci, and Mikhail D Lukin · 2021
Later among the works it cites.
Quantum speedup for graph sparsification, cut approximation, and laplacian solving
Simon Apers and Ronald De Wolf · 2022
Later among the works it cites.
Discrepancy minimization in input-sparsity time
Yichuan Deng, Zhao Song, and Omri Weinstein · 2022
Later among the works it cites.
A faster small treewidth sdp solver
Yuzhou Gu and Zhao Song · 2022
Later among the works it cites.
An improved quantum-inspired algorithm for linear regression
András Gilyén, Zhao Song, and Ewin Tang · 2022
Later among the works it cites.
A faster quantum algorithm for semidefinite programming via robust ipm framework
Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, and Ruizhe Zhang · 2022
Later among the works it cites.
Solving sdp faster: A robust ipm framework and efficient implementation
Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, and Ruizhe Zhang · 2022
Later among the works it cites.
Speeding up sparsification using inner product search data structures
Zhao Song, Zhaozhuo Xu, and Lichen Zhang · 2022
Later among the works it cites.
Faster algorithm for structured john ellipsoid computation
Zhao Song, Xin Yang, Yuanyuan Yang, and Tianyi Zhou · 2022
Later among the works it cites.
Quantum speedups for linear programming via interior point methods
Simon Apers and Sander Gribling · 2023
Later among the works it cites.
Yeqi Gao, Zhao Song, Weixin Wang, and Junze Yin · 2023
Later among the works it cites.
An iterative algorithm for rescaled hyperbolic functions regression
Yeqi Gao, Zhao Song, and Junze Yin · 2023
Later among the works it cites.
Fast quantum algorithm for attention computation
Yeqi Gao, Zhao Song, Xin Yang, and Ruizhe Zhang · 2023
Later among the works it cites.
A nearly-linear time algorithm for structured support vector machines
Yuzhou Gu, Zhao Song, and Lichen Zhang · 2023
Later among the works it cites.
Quantum computing inspired iterative refinement for semidefinite optimization
Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Pouya Sampourmahani, and Tamás Terlaky · 2023
Later among the works it cites.
An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization
Lianke Qin, Zhao Song, Lichen Zhang, and Danyang Zhuo · 2023
Later among the works it cites.
Quantum speedup of leverage score sampling and its application, 2023
Changpeng Shao · 2023
Later among the works it cites.
Sketching for first order method: Efficient algorithm for low-bandwidth channel and vulnerability
Zhao Song, Yitan Wang, Zheng Yu, and Lichen Zhang · 2023
Later among the works it cites.
Solving attention kernel regression problem via pre-conditioner
Zhao Song, Junze Yin, and Lichen Zhang · 2023
Later among the works it cites.
Revisiting quantum algorithms for linear regressions: Quadratic speedups without data-dependent parameters, 2023
Zhao Song, Junze Yin, and Ruizhe Zhang · 2023
Later among the works it cites.
More asymmetry yields faster matrix multiplication, 2024
Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou · 2024
Closest in time.
Quantum speedup for spectral approximation of kronecker products, 2024
Yeqi Gao, Zhao Song, and Ruizhe Zhang · 2024
Closest in time.
Fast john ellipsoid computation with differential privacy optimization, 2024
Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, and Junwei Yu · 2024
Closest in time.
Uncertainty quantification of set-membership estimation in control and perception: Revisiting the minimum enclosing ellipsoid
Yukai Tang, Jean-Bernard Lasserre, and Heng Yang · 2024
Closest in time.
New bounds for matrix multiplication: from alpha to omega
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou · 2024
Closest in time.