Optimal finite characterization of linear problems with inexact data
From MaRDI portal
The author proves that one cannot improve the result by J. Rohn, saying that any interval matrix property can be established by checking \(2^{2n-1}\) vertex matrices.
Recommendations
- Linear Optimization Problems with Inexact Data
- scientific article; zbMATH DE number 3965817
- Certain methods for linear problems with inexact initial data
- Characterization of total ill-posedness in linear semi-infinite optimization
- Characterization and computation of the solution to the optimal L/sub ∞/ approximation problem
- An inexact approach to solving linear semi-infinite programming problems
- Publication:4892204
- The optimal approximations for solving linear ill-posed problems
- scientific article; zbMATH DE number 4159450
- Characterization of the solutions of some optimal-approximation problems
Cites work
Cited in
(7)- Determination of the degrees of \(P\)-property and nonnegative invertibility for a fuzzy matrix
- Inverse of a fuzzy matrix of fuzzy numbers
- Letter to the editor
- Interval analysis for certified numerical solution of problems in robotics
- Positive definiteness of Hermitian interval matrices
- Reduced vertex set result for interval semidefinite optimization problems
- On another view of an inverse of an interval matrix
This page was built for publication: Optimal finite characterization of linear problems with inexact data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568636)