Accelerated Frank–Wolfe Algorithms

This paper presents a class of iterative procedures, called accelerated Frank–Wolfe algorithms, It shows that a subclass, namely the nontrivial proper algorithms, is of special interest. An algorithm parametrized by an integer q is exhibited and it is then seen that for every $q > 0$, the algorithm is a nontrivial proper accelerated Frank–Wolfe algorithm.