Pages that link to "Item:Q1190121"
From MaRDI portal
The following pages link to Triangular truncation and finding the norm of a Hadamard multiplier (Q1190121):
Displaying 18 items.
- Majorizations and inequalities in matrix theory (Q1322858) (← links)
- Geometry and the norms of Hadamard multipliers (Q1805207) (← links)
- Estimating Hadamard operator norms, with application to triangular truncation (Q1805217) (← links)
- A note on 0-1 Schur multipliers (Q1894464) (← links)
- Cut norm discontinuity of triangular truncation of graphons (Q2154285) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- The spectral density of Hankel operators with piecewise continuous symbols (Q2284359) (← links)
- Schur multiplier norms for Loewner matrices (Q2435420) (← links)
- Finding norms of Hadamard multipliers (Q2564955) (← links)
- Gromov-Hausdorff convergence of state spaces for spectral truncations (Q2662735) (← links)
- Pinching, Trimming, Truncating, and Averaging of Matrices (Q2757496) (← links)
- Triangular truncation and its extremal matrices (Q2955974) (← links)
- On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
- (Q4835030) (← links)
- Triangular Truncation and Normal Limits of Nilpotent Operators (Q4845882) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems (Q5885811) (← links)
- Reflective block Kaczmarz algorithms for least squares (Q6635270) (← links)
