Radii of solvability and unsolvability of linear systems
From MaRDI portal
Publication:277137
DOI10.1016/j.laa.2016.03.028zbMath1338.65124OpenAlexW2324600279MaRDI QIDQ277137
Publication date: 4 May 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.028
Related Items (5)
Two optimization problems in linear regression with interval data ⋮ Tolerances, robustness and parametrization of matrix properties related to optimization problems ⋮ Optimal correction of the absolute value equations ⋮ On the optimal correction of infeasible systems of linear inequalities ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm
Cites Work
- Unnamed Item
- Overview of total least-squares methods
- Weak and strong solvability of interval linear systems of equations and inequalities
- Computational complexity and feasibility of data processing and interval computations
- Checking robust nonsingularity is NP-hard
- An interior-point method for multifractional programs with convex constraints
- An interior-point method for generalized linear-fractional programming
- A note on dependency between interval linear systems
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Tight Bounds on the Radius of Nonsingularity
- Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix
- Linear Optimization Problems with Inexact Data
This page was built for publication: Radii of solvability and unsolvability of linear systems