Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CORR
2007
Springer

favoriteEmaildiscussreport

76views Education» more CORR 2007»

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms

13 years 4 months ago

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms

Download www-personal.umich.edu

Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions – computing the size of projections of high dimensional polytopes and estimating the norms of random matrices and their inverses.

Roman Vershynin

Real-time Traffic

Asymptotic Convex Geometry | CORR 2007 | Education | Linear Programming | Simplex Method |

claim paper

Related Content

» Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

» On stochastic receding horizon control with bounded control inputs

» Imaging Schemes for Perfectly Conducting Cracks

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Roman Vershynin

Comments (0)