arXiv (All)
open access
A simple and practical adaptive trust-region method
We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of Ssorensen. The method achieves the best possible convergence bound up to an additive logarit
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
- Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad#200482
- Many Optimizers But Only One Training Path: Repeated Resampling for Adaptive Optimizer Selection#467148
- The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning#792678
- The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning#788678
- Convergence and Robustness Bounds for Distributed Asynchronous Shortest-Path#999663
Record · ID 1049602
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