Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Computational Geometry
2025-10-20 v1 Data Structures and Algorithms
Numerical Analysis
Numerical Analysis
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.
Cite
@article{arxiv.cs/0703093,
title = {Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms},
author = {Roman Vershynin},
journal= {arXiv preprint arXiv:cs/0703093},
year = {2025}
}
Comments
12 pages, no figures. Based on the talk at the 2006 conference on Banach Spaces and their applications in analysis