REVIEW 1 cited by
An Affine Invariant Linear Convergence Analysis for Frank-Wolfe Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the linear convergence of variants of the Frank-Wolfe algorithms for some classes of strongly convex problems, using only affine-invariant quantities. As in Guelat & Marcotte (1986), we show the linear convergence of the standard Frank-Wolfe algorithm when the solution is in the interior of the domain, but with affine invariant constants. We also show the linear convergence of the away-steps variant of the Frank-Wolfe algorithm, but with constants which only depend on the geometry of the domain, and not any property of the location of the optimal solution. Running these algorithms does not require knowing any problem specific parameters.
Forward citations
Cited by 1 Pith paper
-
Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions
MELMO provably matches the best known convergence rates for weakly convex composite optimization while allowing non-Euclidean update directions.
Discussion (0). Continue with ORCID to comment.