On optimality of Krylov's information when solving linear operator equations
From MaRDI portal
Publication:1179025
DOI10.1016/0885-064X(91)90001-EzbMATH Open0757.47010OpenAlexW2026040627MaRDI QIDQ1179025FDOQ1179025
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
Recommendations
Cites Work
Cited In (16)
- Perspectives on information-based complexity
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- Randomized block Krylov methods for approximating extreme eigenvalues
- On the oracle complexity of smooth strongly convex minimization
- On the optimality of Krylov information
- Approximating fixed points of weakly contracting mappings
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Krylov solvability of unbounded inverse linear problems
- On lower complexity bounds for large-scale smooth convex optimization
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation
- Complementary composite minimization, small gradients in general norms, and applications
- Existence and computation of short-run equilibria in economic geography
- Excess information in parametric linear optimization
- Information-based complexity of linear operator equations
- Minimal residual algorithm and matrix-vector information
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)