arXiv (OAI Expanded)
open access
On the Complexity of BFGS Method for Smooth Convex Optimization
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
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#819718
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#809722
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- Complexity analysis of trust-region methods under $(α,L_0,L_1)$-smoothness#1117950
Record · ID 617183
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