Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- 30 November 2021
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 197 (1) , 191-214
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CMMI-1452463)
- Deutsche Forschungsgemeinschaft (DFG Cluster of Excellence MATH+)
This publication has 22 references indexed in Scilit:
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Clarke Subgradients of Stratifiable FunctionsSIAM Journal on Optimization, 2007
- On the duality problem for entropy numbers of operators2006
- On gradients of functions definable in o-minimal structuresAnnales de l'institut Fourier, 1998
- Conditional gradient algorithms with open loop step size rulesJournal of Mathematical Analysis and Applications, 1978
- An extension of the frank and Wolfe method of feasible directionsMathematical Programming, 1974
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe AlgorithmSIAM Journal on Control, 1968
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Gradient methods for the minimisation of functionalsUSSR Computational Mathematics and Mathematical Physics, 1963
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956