22 citations · 29 across the 3 of their papers we have counts for
5 papers · 1 filter
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
Dan Garber
In recent years it was proved that simple modifications of the classical Frank-Wolfe algorithm (aka conditional gradient algorithm) for smooth convex minimization over convex and c…
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems
Dan Garber
Smooth convex minimization over the unit trace-norm ball is an important optimization problem in machine learning, signal processing, statistics and other fields, that underlies ma…
Linear-memory and Decomposition-invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes
Dan Garber, Ofer Meshi
Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably…
Faster Projection-free Convex Optimization over the Spectrahedron
Dan Garber
Minimizing a convex function over the spectrahedron, i.e., the set of all positive semidefinite matrices with unit trace, is an important optimization task with many applications i…
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…