This paper presents a projection-free algorithm that converges linearly for strongly convex minimization over convex sets satisfying a uniform rolling-ball condition, using only membership queries.
Levy and Andreas Krause
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets
This paper presents a projection-free algorithm that converges linearly for strongly convex minimization over convex sets satisfying a uniform rolling-ball condition, using only membership queries.