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

DOI10.1016/0885-064X(91)90001-EMaRDI QIDQ1179025zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the optimality of Krylov information
• Information-based complexity of linear operator equations
• On the Optimal Solution of Large Linear Systems
• Minimal residual algorithm and matrix-vector information

Cites work

• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• On the optimality of Krylov information

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179025)