Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
<|reference_start|>Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms: 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.<|reference_end|>
@article{vershynin2007some,
    title={Some problems in asymptotic convex geometry and random matrices
  motivated by numerical algorithms},
    author={Roman Vershynin},
    journal={Banach spaces and their applications in analysis, 209--218, Walter
  de Gruyter, Berlin, 2007},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0703093},
    primaryClass={cs.CG cs.DS cs.NA}
}