Pages that link to "Item:Q4498326"
From MaRDI portal
The following pages link to Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326):
Displaying 14 items.
- Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding. (Q954610) (← links)
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming (Q1758029) (← links)
- Two proposals for robust PCA using semidefinite programming (Q1952221) (← links)
- The global convergence of the nonlinear power method for mixed-subordinate matrix norms (Q2049097) (← links)
- Optimization of the shape (and topology) of the initial conditions for diffusion parameter identification (Q2204030) (← links)
- Complexity of computing interval matrix powers for special classes of matrices. (Q2216226) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- Complexity issues for the symmetric interval eigenvalue problem (Q2257476) (← links)
- Linear interval equations: Midpoint preconditioning may produce a 100\% overestimation for arbitrarily narrow data even in case \(n = 4\) (Q2484034) (← links)
- Error bounds and a condition number for the absolute value equations (Q2687040) (← links)
- Bounds for the Distance to the Nearest Correlation Matrix (Q2818268) (← links)
- Composite norms and perfect conditioning (Q3521126) (← links)
- Tolerances, robustness and parametrization of matrix properties related to optimization problems (Q4634170) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
