arXiv (All)
open access
Structural conditions on trust-region radius updates. Part I: first-order convergence and complexity
Trust-region methods differ chiefly in how they update the radius, and each rule has traditionally been analysed on its own terms. We show that three structural conditions on the radius sequence suffice: a lower bound relative to the gradient norm, a contraction on unsuccessful iterations, and a con
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
- Framework for Loop-Free Convergence Using the Ordered Forwarding Information Base (oFIB) Approach#220707
- An error bound-based convergence analysis framework for a class of randomized algorithms#798805
- An error bound-based convergence analysis framework for a class of randomized algorithms#797391
- Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification#1154795
- Splitting Methods for Nonconvex Optimisation: Convergence and Saddle Point Avoidance Through Shadow Sequences#1142597
Record · ID 1400969
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