On optimality of Krylov's information when solving linear operator equations

DOI10.1016/0885-064X(91)90001-EzbMath0757.47010OpenAlexW2026040627MaRDI QIDQ1179025

Arkadi Nemirovski

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90001-e

zbMATH Keywords

linear operator equationsChebyshev-type methodsKrylov's informationworst-case efficiency estimate

Mathematics Subject Classification ID

Equations and inequalities involving linear operators, with vector unknowns (47A50)

Related Items (12)

Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation ⋮ Perspectives on information-based complexity ⋮ Existence and computation of short-run equilibria in economic geography ⋮ Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems ⋮ On lower complexity bounds for large-scale smooth convex optimization ⋮ Approximating fixed points of weakly contracting mappings ⋮ Information-based complexity of linear operator equations ⋮ On the oracle complexity of smooth strongly convex minimization ⋮ Minimal residual algorithm and matrix-vector information ⋮ Randomized block Krylov methods for approximating extreme eigenvalues

Cites Work

• Unnamed Item
• On the optimality of Krylov information

This page was built for publication: On optimality of Krylov's information when solving linear operator equations