A secant-method line search computes near-exact Frank-Wolfe step sizes in few gradient evaluations, claiming to match exact line search in theory and practice.
In (a), the iterations and time are truncated at 10000 and 10 s, repectively, since Backtracking and Agnostic stall on this instance
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Secant Line Search for Frank-Wolfe Algorithms
A secant-method line search computes near-exact Frank-Wolfe step sizes in few gradient evaluations, claiming to match exact line search in theory and practice.