Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds

preprint2011arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.