2.5k citations · 4.7k across the 60 of their papers we have counts for
Showing 2014 · cs.DSShow all
3 papers · 2 filters
cs.DS2014
Nearly Linear-Time Packing and Covering LP Solvers
Zeyuan Allen-Zhu, Lorenzo Orecchia
Packing and covering linear programs (PC-LPs) form an important class of linear programs (LPs) across computer science, operations research, and optimization. In 1993, Luby and Nis…
cs.DS2014
Restricted Isometry Property for General p-Norms
Zeyuan Allen-Zhu, Rati Gelashvili, Ilya Razenshteyn
The Restricted Isometry Property (RIP) is a fundamental property of a matrix which enables sparse recovery. Informally, an matrix satisfies RIP of order for the $\…
cs.DS2014★ 1 cited
Using Optimization to Solve Positive LPs Faster in Parallel
Zeyuan Allen-Zhu, Lorenzo Orecchia
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimi…