scientific article; zbMATH DE number 7064051
From MaRDI portal
Publication:5381125
zbMath1492.90121arXiv1610.05120MaRDI QIDQ5381125
Daniel Zink, Gábor Braun, Sebastian Pokutta
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1610.05120
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (9)
An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso ⋮ The Frank-Wolfe algorithm: a short introduction ⋮ Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints ⋮ Adaptive conditional gradient method ⋮ Unnamed Item ⋮ Complexity of linear minimization and projection on some sets ⋮ Restarting Frank-Wolfe: faster rates under Hölderian error bounds
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An application of simultaneous diophantine approximation in combinatorial optimization
- Geometric algorithms and combinatorial optimization.
- Solving MIPs via scaling-based augmentation
- Integer convex minimization by mixed integer linear optimization
- Cutting-plane training of structural SVMs
- Efficient algorithms for online decision problems
- Conditional Gradient Sliding for Convex Optimization
- An Efficient Algorithm for Learning with Semi-bandit Feedback
- Regret in Online Combinatorial Optimization
- The Complexity of Generic Primal Algorithms for Solving General Integer Programs
- 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
- 0/1-Integer programming: Optimization and Augmentation are equivalent
This page was built for publication:
