arXiv (All)
open access
Cyclic steepest descent is $R$-superlinearly convergent for almost every initialization on two-spectrum quadratics
We completely classify cyclic steepest descent (CSD) on strictly convex quadratics whose Hessian has exactly two distinct eigenvalues. At the beginning of each cycle CSD recomputes an exact steepest-descent stepsize and reuses it for $m$ updates. For every $m\ge2$, write $A=aP+bQ$ with $0<a<b$ and s
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
- Higher $q$-Continued Fractions and Dimers on Band Graphs#625529
- Higher $q$-Continued Fractions and Dimers on Band Graphs#623256
- Threshold Graphs Allow Few Distinct Eigenvalues: A New Approach#997625
- A sharp bound for the least signless Laplacian eigenvalue of triangle-free graphs#1325399
- Global and Unconditional $R$-Linear Convergence of Rank-Compressed Weighted LMSD Sweeps for Strictly Convex Quadratics#1000083
Record · ID 1326585
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