arXiv (All)
open access
Powell-Style Model-Based Derivative-Free Optimization with Complexity Guarantees
We propose variants of model-based trust region derivative-free algorithms that are closest to methods initially proposed and implemented by Powell. These methods rely on low degree polynomial interpolation and carefully maintain geometry of the interpolation sets. We are able to derive complexity b
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
- Communication-Efficient Zero-Order and First-Order Federated Learning Methods over Wireless Networks#231503
- Online adaptive non-intrusive model reduction via manifold interpolation and subspace updates: application to FSI convergence acceleration#1123293
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#612466
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#610989
- Efficient Linear Bandits via Cluster-Aware Sketching#1064138
Record · ID 987188
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