Under smoothness, strong convexity, and the Kurdyka-Lojasiewicz property, the greedy Frank-Wolfe sequence converges to a critical point, with rates that depend on the KL exponent.
First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\L}ojasiewicz Inequality
Under smoothness, strong convexity, and the Kurdyka-Lojasiewicz property, the greedy Frank-Wolfe sequence converges to a critical point, with rates that depend on the KL exponent.