It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
From MaRDI portal
Publication:1319351
DOI10.1006/jcom.1994.1001zbMath0798.68074OpenAlexW1996452068MaRDI QIDQ1319351
Publication date: 12 April 1994
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1994.1001
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Semialgebraic sets and related spaces (14P10) Computer aspects of numerical algorithms (65Y99)
Related Items (9)
The Legacy of Turing in Numerical Analysis ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Smoothed analysis of complex conic condition numbers ⋮ Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem ⋮ On the probability distribution of data at points in real complete intersection varieties ⋮ Probabilistic analyses of condition numbers ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
This page was built for publication: It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
