arXiv (All)
open access
Doubly exponential convergence of the cyclic steepest descent method for strictly convex quadratics in arbitrary dimensions
We study the cyclic steepest descent method (CSD) for strictly convex quadratic minimization. CSD repeats, for j consecutive iterations, the exact steepest-descent step size computed at the beginning of each cycle. The only rigorous result for the real algorithm has so far been restricted to two dim
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
- A Two-Dimensional Extremizer for Relatively Inexact Gradient Descent#1154779
- Finite-Precision Symmetric Krylov Methods: Exact Rounding Examples, Block Paige Identities,and a Variable-Block Lanczos Model#985459
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
- Shortest undirected paths in de Bruijn Graphs#1136734
- Lanczos with compression for symmetric eigenvalue problems#635753
Record · ID 1061430
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