Follow
Guanghao Ye
Guanghao Ye
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path
S Dong, YT Lee, G Ye
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
582021
A gradient sampling method with complexity guarantees for lipschitz functions in high and low dimensions
D Davis, D Drusvyatskiy, YT Lee, S Padmanabhan, G Ye
Advances in Neural Information Processing Systems 35, 6692-6703, 2022
26*2022
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
S Dong, Y Gao, G Goranci, YT Lee, R Peng, S Sachdeva, G Ye
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
182022
Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time
J Li, G Ye
Advances in Neural Information Processing Systems 33, 2020
142020
Fast Algorithm for Solving Structured Convex Programs
G Ye
The University of Washington, Undergraduate Thesis, 2020
72020
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity
S Dong, H Jiang, YT Lee, S Padmanabhan, G Ye
Advances in Neural Information Processing Systems 35, 2022
32022
Improving the Bit Complexity of Communication for Distributed Convex Optimization
M Ghadiri, YT Lee, S Padmanabhan, W Swartworth, D Woodruff, G Ye
arXiv preprint arXiv:2403.19146, 2024
2024
Fast Algorithms for Separable Linear Programs
S Dong, G Goranci, L Li, S Sachdeva, G Ye
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
Faster Min-Cost Flow on Bounded Treewidth Graphs
S Dong, G Ye
arXiv preprint arXiv:2308.14727, 2023
2023
Solving Second-Order Cone Programs Deterministically in Matrix Multiplication Time
M Wei, G Ye
The system can't perform the operation now. Try again later.
Articles 1–10