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 algor...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on control 1974-11, Vol.12 (4), p.655-663
Main Author: Meyer, Gerard G. L.
Format: Article
Language:English
Subjects:
Algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0036-1402
0363-0129
1095-7138
DOI:10.1137/0312050