arXiv (All)
open access
Frank-Wolfe Algorithms for (L0, L1)-smooth functions
We propose a new version of the Frank-Wolfe method, called the (L0, L1)-Frank-Wolfe algorithm, developed for optimization problems with (L0, L1)-smooth objectives. We establish that this algorithm achieves superior theoretical convergence rates compared to the classical Frank-Wolfe method. In additi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Novel Multi-fidelity Surrogate for Turbomachinery Design Optimization#998666
- Learning to Optimize by Differentiable Programming#798738
- Learning to Optimize by Differentiable Programming#797324
- On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems#467138
- Near-Optimal Higher-Order Oracle Complexity for Convex--Concave Minimax Optimization#1064790
Record · ID 1201931
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive