The Frank-Wolfe algorithm: a short introduction
From MaRDI portal
Publication:6118086
DOI10.1365/s13291-023-00275-xarXiv2311.05313OpenAlexW4389682008MaRDI QIDQ6118086
Publication date: 23 February 2024
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2311.05313
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Lectures on convex optimization
- Introductory lectures on convex optimization. A basic course.
- Interior-point methods
- Complexity of linear minimization and projection on some sets
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Submodular functions: from discrete to continuous domains
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- Duality Between Subgradient and Conditional Gradient Methods
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion
- The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
- Some comments on Wolfe's ‘away step’
- The Matching Polytope has Exponential Extension Complexity
- The matching polytope does not admit fully-polynomial size relaxation schemes
- Fast algorithms for maximizing submodular functions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- An elementary approach to tight worst case complexity analysis of gradient based methods
This page was built for publication: The Frank-Wolfe algorithm: a short introduction