Pages that link to "Item:Q1179025"
From MaRDI portal
The following pages link to On optimality of Krylov's information when solving linear operator equations (Q1179025):
Displaying 13 items.
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Existence and computation of short-run equilibria in economic geography (Q870122) (← links)
- Information-based complexity of linear operator equations (Q1194382) (← links)
- Minimal residual algorithm and matrix-vector information (Q1816693) (← links)
- Approximating fixed points of weakly contracting mappings (Q1974567) (← links)
- On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
- Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation (Q5885838) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
- Complementary composite minimization, small gradients in general norms, and applications (Q6634528) (← links)
