Amelunxen, Dennis and Lotz, Martin (2014) Gordon's inequality and condition numbers in conic optimization. [MIMS Preprint]
![[thumbnail of gordcond.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
gordcond.pdf Download (495kB) |
Abstract
The probabilistic analysis of condition numbers has traditionally been approached from different angles; one is based on Smale's program in complexity theory and features integral geometry, while the other is motivated by geometric functional analysis and makes use of the theory of Gaussian processes. In this note we explore connections between the two approaches in the context of the biconic homogeneous feasiblity problem and the condition numbers motivated by conic optimization theory. Key tools in the analysis are Slepian's and Gordon's comparision inequalities for Gaussian processes, interpreted as monotonicity properties of moment functionals, and their interplay with ideas from conic integral geometry.
| Item Type: | MIMS Preprint |
|---|---|
| Uncontrolled Keywords: | Slepian inequality, Gordon inequality, convex cones, condition number, random matrix theory, convex analysis, geometric functional analysis |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 52 Convex and discrete geometry MSC 2010, the AMS's Mathematics Subject Classification > 60 Probability theory and stochastic processes MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis MSC 2010, the AMS's Mathematics Subject Classification > 90 Operations research, mathematical programming |
| Depositing User: | Dr. Martin Lotz |
| Date Deposited: | 15 Aug 2014 |
| Last Modified: | 08 Nov 2017 18:18 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/2168 |
Actions (login required)
 |
View Item |