convex optimization

Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate
Zeyuan Allen-Zhu, Lorenzo Orecchia
ACM ArXiv
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
Zeyuan Allen-Zhu, Lorenzo Orecchia
ArXiv ACM
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Co-winner of Best Paper Award at SODA 2014.
Jonathan A. Kelner, YinTat Lee, Lorenzo Orecchia, Aaron Sidford
DOI ArXiv SIAM
A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time
Jonathan A. Kelner, , Aaron Sidford, Zeyuan Allen-Zhu
ArXiv ACM