On the complexity of solving feasible systems of linear inequalities specified with approximate data
type: Item
instance of: scholarly article
title: On the complexity of solving feasible systems of linear inequalities specified with approximate data
zbMATH Open document ID: 0851.90083
DOI: 10.1007/BF01590957
author: Sharon Filipowski
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 910014
zbMATH Keywords: condition measures
zbMATH Keywords: approximate solution
zbMATH Keywords: system of linear inequalities
zbMATH Keywords: approximate data
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: On Perturbations in Systems of Linear Inequalities
cites work: On condition numbers and the distance to the nearest ill-posed problem
cites work: Paths, Trees, and Flowers
cites work: Q3359644
cites work: On the solution of linear algebraic equations with interval coefficients
cites work: Perturbation Analysis of a Condition Number for Linear Systems
cites work: Q4742548
cites work: A Condition Number for Differentiable Convex Inequalities
cites work: Q3207999
cites work: Some perturbation theory for linear programming
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Bounds for error in the solution set of a perturbed linear program
cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems
cites work: Systems of linear interval equations
cites work: Some Remarks on the Foundations of Numerical Analysis
cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES
cites work: Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
cites work: Numerical inverting of matrices of high order
cites work: Q4342463
cites work: Q4871634
Recommended article: On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
Recommended article: On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
Recommended article: Q3727270
Recommended article: Approximations to Solutions to Systems of Linear Inequalities
Recommended article: Q4369264
Recommended article: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Recommended article: Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
Recommended article: Q3341782
Recommended article: Bounding the error for approximate solutions of almost linear complementarity problems using feasible vectors
Recommended article: Q3763491
description: scientific article; zbMATH DE number 910014