96 citations · 311 across the 29 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2017★ 6 cited
Lower Bounds for Higher-Order Convex Optimization
Naman Agarwal, Elad Hazan
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-ord…
math.OC2016
Optimal Black-Box Reductions Between Optimization Objectives
Zeyuan Allen-Zhu, Elad Hazan
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification ta…
math.OC2012
Almost Optimal Sublinear Time Algorithm for Semidefinite Programming
Dan Garber, Elad Hazan
We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We also present lower bou…