Revisiting Decomposition-Invariant Conditional Gradient Methods for Polytopes (Q7284563)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting Decomposition-Invariant Conditional Gradient Methods for Polytopes |
No description defined |
Statements
Revisiting Decomposition-Invariant Conditional Gradient Methods for Polytopes (English)
0 references
2 August 2026
0 references
math.OC
0 references
math.NA
0 references
Dan Garber
0 references
We revisit Decomposition-Invariant Conditional Gradient methods and design new methods for minimizing convex functions over polytopes. For 2-level polytopes we obtain linear convergence with a dimension-free step-size rule, while for general polytopes our method scales with the optimal face dimension rather than ambient dimension.
0 references
Conditional Gradient
0 references
Polytopes
0 references
Gradient Descent
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
