Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
计算几何
2025-10-20 v1 数据结构与算法
数值分析
数值分析
摘要
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.
引用
@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}
}
备注
12 pages, no figures. Based on the talk at the 2006 conference on Banach Spaces and their applications in analysis