A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
From MaRDI portal
Cited in
(38)- Extremal types for certain L^ p minimization problems and associated large scale nonlinear programs
- Efficiency and proper efficiency in vector maximization with respect to cones
- Finiteness in restricted simplicial decomposition
- On the convexity of integrals of multivalued mappings. Applications in control theory
- Minimizing pseudoconvex functions on convex compact sets
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- Minimization methods with constraints
- Conditional gradient algorithms with open loop step size rules
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- Partial linearization methods in nonlinear programming
- Numerical implementation of two nonconforming finite element methods for unilateral contact
- Complexity of linear minimization and projection on some sets
- First-order methods for the convex hull membership problem
- Avoiding bad steps in Frank-Wolfe variants
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- Mixed finite element methods for unilateral problems: Convergence analysis and numerical studies
- The cyclic block conditional gradient method for convex optimization problems
- A minimum-cost multicommodity network flow problem concerning imports and exports
- Finding the nearest point in A polytope
- Compact convex projections
- Generalized conditional gradient for sparse estimation
- Robust analysis in stochastic simulation: computation and performance guarantees
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- On the effectiveness of Richardson extrapolation in data science
- Active set complexity of the away-step Frank-Wolfe algorithm
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Riemannian optimization via Frank-Wolfe methods
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
- First-order methods for convex optimization
- Primal and dual predicted decrease approximation methods
- Improved algorithms and novel applications of the FrankWolfe.jl library
- Adaptive variants of Frank-Wolfe method with relative inexact gradient information
- Improved convergence rates for the multiobjective Frank-Wolfe method
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
This page was built for publication: A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580057)
