scientific article; zbMATH DE number 5764862
From MaRDI portal
Publication:3579455
Cited in
(16)- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- An algorithmic separating hyperplane theorem and its applications
- Sparse Approximate Solutions to Semidefinite Programs
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Low complexity regularization of linear inverse problems
- On lower complexity bounds for large-scale smooth convex optimization
- New analysis and results for the Frank-Wolfe method
- Quadratic model for allocating operational budget in public and nonprofit organizations
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Deviation optimal learning using greedy \(Q\)-aggregation
- No dimension-independent core-sets for containment under homothetics
- Streaming algorithms for extent problems in high dimensions
- A characterization theorem and an algorithm for a convex hull problem
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Block coordinate descent methods for semidefinite programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579455)
