Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds
Abstract
We prove an O(log n) bound for the expectation of the logarithm of the condition number K for the computation of optimizers of linear programs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.