Frank-Wolfe and friends: a journey into projection-free first-order optimization methods

Related Items (3)

The Frank-Wolfe algorithm: a short introduction ⋮ Two-stage stochastic standard quadratic optimization ⋮ Avoiding bad steps in Frank-Wolfe variants

Uses Software

PDCO

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A framework for and empirical study of algorithms for traffic assignment
First-order methods of smooth convex optimization with inexact oracle
Conditional gradient algorithms for norm-regularized smooth convex optimization
An active-set algorithmic framework for non-convex optimization problems over the simplex
Concave programming for minimizing the zero-norm over polyhedral sets
Conditional gradient algorithms with open loop step size rules
Evolution towards the maximum clique
Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
The condition number of a function relative to a set
First-order and stochastic optimization methods for machine learning
Linearly convergent away-step conditional gradient for non-strongly convex functions
A review on algorithms for maximum clique problems
Exact matrix completion via convex optimization
Atomic Decomposition by Basis Pursuit
Conditional Gradient Sliding for Convex Optimization
Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion
Two Algorithms for the Minimum Enclosing Ball Problem
The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
Some comments on Wolfe's ‘away step’
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
Finding the nearest point in A polytope
Simplicial decomposition in nonlinear programming algorithms
Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
Finding the Point of a Polyhedron Closest to the Origin
Simplified versions of the conditional gradient method
An extension of the frank and Wolfe method of feasible directions
A General Regularized Continuous Formulation for the Maximum Clique Problem
Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
Learning with Submodular Functions: A Convex Optimization Perspective
Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
Approximate minimum enclosing balls in high dimensions using core-sets
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
New analysis and results for the Frank-Wolfe method

This page was built for publication: Frank-Wolfe and friends: a journey into projection-free first-order optimization methods