Showing 2026Show all
3 papers · 1 filter
math.OC2026
Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization
Dan Garber
We consider a standard convex composite optimization problem with either smooth or nonsmooth objective function, and under quadratic growth. In recent years, several works gave alg…
math.OC2026
Linear Convergence of a Frank-Wolfe-type Method over the Spectrahedron without Strict Complementarity
Dan Garber
We consider smooth convex minimization over the spectrahedron using Frank-Wolfe-type methods based only on extreme-eigenvector computations. In our recent work \cite{garber2026rand…
math.OC2026
Revisiting Decomposition-Invariant Conditional Gradient Methods for Polytopes
Dan Garber
We revisit Decomposition-Invariant Conditional Gradient methods, originally introduced by Garber and Meshi in 2016, for minimizing a convex and -smooth function over a polytope…