arXiv (All)
open access
Finite Newton-Step Generation via Subspace Quasi-Newton Methods for Quadratic Problems
We study the curvature information sufficient for finite Newton-step generation by quasi-Newton methods on strictly convex quadratic problems. In exact arithmetic, the memoryless BFGS quasi-Newton method terminates finitely on such a problem when exact line search is used, although its quasi-Newton
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
- Finite Newton-Step Generation via Subspace Quasi-Newton Methods for Quadratic Problems#919758
- A priori and a posteriori error estimates of a $C^0$-in-time method for the wave equation in second order formulation#153834
- Error indicators and adaptivity for a least-squares method applied to the Monge-Ampère equation#1141427
- Third-order Halley-type iterative method with positive and bounded correction function#985497
- An inertial extrapolation method for convex simple bilevel optimization#196252
Record · ID 923987
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