A unified analysis of stochastic gradient‐free Frank–Wolfe methods
From MaRDI portal
(Redirected from Publication:6092499)
Cites work
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Complexity bounds for primal-dual methods minimizing the model of objective function
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- Convex optimization: algorithms and complexity
- Derivative-free optimization methods
- First-order and stochastic optimization methods for machine learning
- Generalized conditional gradient for sparse estimation
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 3385132 (Why is no real title available?)
- Implementation of an optimal first-order method for strongly convex total variation regularization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- New analysis and results for the Frank-Wolfe method
- Non-convex optimization for machine learning
- Random gradient-free minimization of convex functions
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Surrogate‐based methods for black‐box optimization
Cited in
(2)
This page was built for publication: A unified analysis of stochastic gradient‐free Frank–Wolfe methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092499)
