\begin{thebibliography}{10}

\bibitem{Mohasel15}
H.~M. Afshar and J.~Domke.
\newblock Reflection, {R}efraction, and {Hamiltonian Monte Carlo}.
\newblock In {\em Proc. 28th NeurIPS}, pages 3007--3015, Cambridge, MA, USA,
  2015. MIT Press.

\bibitem{ArmBel-rand-pep-19}
D.~Armentano and C.~Beltr{\'a}n.
\newblock The polynomial eigenvalue problem is well conditioned for random
  inputs.
\newblock {\em SIMAX}, 40(1):175--193, 2019.

\bibitem{BelKoz-real-pep-19}
C.~Beltr{\'a}n and K.~Kozhasov.
\newblock The real polynomial eigenvalue problem is well conditioned on the
  average.
\newblock {\em J. Foundations of Computational Math.}, pages 1--19, 2019.

\bibitem{Berhanu-phd-05}
M.~Berhanu.
\newblock {\em The polynomial eigenvalue problem}.
\newblock PhD thesis, University of Manchester, 2005.

\bibitem{Betancourt17}
M.~Betancourt.
\newblock {A conceptual introduction to Hamiltonian Monte Carlo}.
\newblock {\em arXiv preprint arXiv:1701.02434}, 2017.

\bibitem{Blondel00}
V.~D. Blondel and J.~N. Tsitsiklis.
\newblock A survey of computational complexity results in systems and control.
\newblock {\em Automatica}, 36(9):1249--1274, 2000.

\bibitem{BT-nonlinear-book-06}
J.-D. Boissonnat and M.~Teillaud.
\newblock {\em Effective computational geometry for curves and surfaces}.
\newblock Springer, 2006.

\bibitem{Breiding17}
P.~Breiding, K.~Kozhasov, and A.~Lerario.
\newblock Random spectrahedra.
\newblock {\em SIAM J. Optimization}, 29(4):2608--2624, 2019.

\bibitem{Bueler98}
B.~Büeler, A.~Enge, and K.~Fukuda.
\newblock Exact {Volume} {Computation} for {Polytopes}: {A} {Practical}
  {Study}.
\newblock In G.~Kalai and G.~M. Ziegler, editors, {\em Polytopes —
  {Combinatorics} and {Computation}}, {DMV} {Seminar}, pages 131--154.
  Birkhäuser, Basel, 2000.

\bibitem{Calafiore-cdc-04}
G.~Calafiore.
\newblock Random walks for probabilistic robustness.
\newblock In {\em Proc. CDC}, volume~5, pages 5316--5321. IEEE, 2004.

\bibitem{CalCam-rc-cdc-03}
G.~Calafiore and M.~Campi.
\newblock Robust convex programs: Randomized solutions and applications in
  control.
\newblock In {\em Proc. CDC}, volume~3, pages 2423--2428. IEEE, 2003.

\bibitem{Chalkis19}
A.~Chalkis, I.~Z. Emiris, and V.~Fisikopoulos.
\newblock Practical volume estimation by a new annealing schedule for cooling
  convex bodies.
\newblock {\em arXiv preprint arXiv:1905.05494}, 2019.

\bibitem{issac_poster}
A.~Chalkis, V.~Fisikopoulos, P.~Repouskos, and E.~Tsigaridas.
\newblock {Sampling the feasible sets of SDPs and volume approximation}.
\newblock {\em poster version in ISSAC 2020, to appear in ACM Communications in
  Computer Algebra}, 2020.

\bibitem{Chen17}
Y.~{Chen}, R.~{Dwivedi}, M.~J. {Wainwright}, and B.~{Yu}.
\newblock Vaidya walk: A sampling algorithm based on the volumetric barrier.
\newblock In {\em 2017 55th Annual Allerton Conference on Communication,
  Control, and Computing (Allerton)}, pages 1220--1227, Oct 2017.

\bibitem{Chevallier18}
A.~Chevallier, S.~Pion, and F.~Cazals.
\newblock {Hamiltonian Monte Carlo with boundary reflections, and application
  to polytope volume calculations}.
\newblock Research Report RR-9222, {INRIA, Sophia-Antipolis, France}, Nov.
  2018.

\bibitem{Cousins15}
B.~Cousins and S.~Vempala.
\newblock Bypassing {KLS: Gaussian} cooling and an ${O}^*(n^3)$ volume
  algorithm.
\newblock In {\em Proc. ACM Symposium Theory of computation (STOC)}, pages
  539--548, 2015.

\bibitem{Cousins16}
B.~Cousins and S.~Vempala.
\newblock A practical volume algorithm.
\newblock {\em Mathematical Programming Computation}, 8, June 2016.

\bibitem{Dabbene2010ARC}
F.~Dabbene, P.~Shcherbakov, and B.~T. Polyak.
\newblock A randomized cutting plane method with probabilistic geometric
  convergence.
\newblock {\em SIAM J. Optimization}, 20:3185--3207, 2010.

\bibitem{DedTis-pep-pert-03}
J.-P. Dedieu and F.~Tisseur.
\newblock Perturbation theory for homogeneous polynomial eigenvalue problems.
\newblock {\em Linear algebra \& Appl.}, 358(1-3):71--94, 2003.

\bibitem{Dyer91}
M.~Dyer, A.~Frieze, and R.~Kannan.
\newblock A random polynomial-time algorithm for approximating the volume of
  convex bodies.
\newblock {\em J. ACM}, 38(1):1--17, 1991.

\bibitem{Emiris18}
I.~Emiris and V.~Fisikopoulos.
\newblock Practical polytope volume approximation.
\newblock {\em ACM Trans. Math. Soft.}, 44(4):38:1--38:21, 2018.
\newblock Prelim. version: Proc. SoCG, 2014.

\bibitem{EmSoTh}
I.~Emiris, F.~Sottile, and T.~Theobald, editors.
\newblock {\em Nonlinear computational geometry}, volume 151 of {\em I.M.A.\
  volumes in Math \& its Applications}.
\newblock Springer, Berlin, Oct. 2010.

\bibitem{emt-dmm-j}
I.~Z. Emiris, B.~Mourrain, and E.~Tsigaridas.
\newblock Separation bounds for polynomial systems.
\newblock {\em J. Symbolic Computation}, 2019.

\bibitem{GryazinaBilliard}
E.~Gryazina and B.~Polyak.
\newblock Random sampling: Billiard walk algorithm.
\newblock {\em European J. Operational Research}, 238, 11 2012.

\bibitem{eigenlib}
G.~Guennebaud, B.~Jacob, et~al.
\newblock Eigen~v3, 2010.
\newblock \url{http://eigen.tuxfamily.org}.

\bibitem{HLS-sa-volume-09}
D.~Henrion, J.~B. Lasserre, and C.~Savorgnan.
\newblock Approximate volume and integration for basic semialgebraic sets.
\newblock {\em SIAM review}, 51(4):722--743, 2009.

\bibitem{Kalai06}
A.~T. Kalai and S.~Vempala.
\newblock Simulated annealing for convex optimization.
\newblock {\em Math. Oper. Res.}, 31(2):253--266, Feb. 2006.

\bibitem{KalVil-det-05}
E.~Kaltofen and G.~Villard.
\newblock On the complexity of computing determinants.
\newblock {\em Computational complexity}, 13(3-4):91--130, 2005.

\bibitem{Khargonekar96}
P.~{Khargonekar} and A.~{Tikku}.
\newblock Randomized algorithms for robust control analysis and synthesis have
  polynomial complexity.
\newblock In {\em Proceedings of 35th IEEE Conference on Decision and Control},
  volume~3, pages 3470--3475, Dec 1996.

\bibitem{KorHen-mom-sa-volume-18}
M.~Korda and D.~Henrion.
\newblock Convergence rates of moment-sum-of-squares hierarchies for volume
  approximation of semialgebraic sets.
\newblock {\em Optimization Letters}, 12(3):435--442, 2018.

\bibitem{LMS-sa-volume-19}
P.~Lairez, M.~Mezzarobba, and M.~Safey El~Din.
\newblock Computing the volume of compact semi-algebraic sets.
\newblock In {\em Proc. ISSAC}. {ACM} Press, 2019.

\bibitem{Lan14}
S.~Lan, B.~Zhou, and B.~Shahbaba.
\newblock Spherical {Hamiltonian} {Monte} {Carlo} for {Constrained} {Target}
  {Distributions}.
\newblock {\em JMLR workshop and Conf procs.}, 32:629--637, 2014.

\bibitem{Lecerf-subres-2019}
G.~Lecerf.
\newblock {On the complexity of the Lickteig{\textendash}Roy subresultant
  algorithm}.
\newblock {\em J. Symbolic Computation}, 92:243--268, May 2019.

\bibitem{Lee18}
Y.~T. Lee, Z.~Song, and S.~S. Vempala.
\newblock Algorithmic theory of odes and sampling from well-conditioned
  logconcave densities, 2018.

\bibitem{LeeRiem18}
Y.~T. Lee and S.~Vempala.
\newblock {Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster
  Polytope Volume Computation}.
\newblock In {\em Proc. ACM Symp. Theory of Computation (STOC)}, 2018.

\bibitem{LicRoy-sub-res-01}
T.~Lickteig and M.-F. Roy.
\newblock Sylvester{\textendash}habicht sequences and fast cauchy index
  computation.
\newblock {\em J. Symbolic Computation}, 31(3):315--341, Mar. 2001.

\bibitem{Lovasz97}
L.~Lov\'asz, R.~Kannan, and M.~Simonovits.
\newblock Random walks and an ${O}^*(n^5)$ volume algorithm for convex bodies.
\newblock {\em Random Structures \& Algorithms}, 11:1--50, 1997.

\bibitem{Lovasz03}
L.~Lov{\'a}sz and S.~Vempala.
\newblock Simulated annealing in convex bodies and an ${O}^{*}(n^4)$ volume
  algorithm.
\newblock In {\em Proc. IEEE Symp. Foundation of Comp. Science (FOCS)}, volume
  2003, pages 650--659, 2003.

\bibitem{Lovasz06}
L.~{Lovasz} and S.~{Vempala}.
\newblock Fast algorithms for logconcave functions: Sampling, rounding,
  integration and optimization.
\newblock In {\em Proc. IEEE Symp. Foundation of Comp. Science (FOCS)}, pages
  57--68, 2006.

\bibitem{20c71247041945789c884f7b64057a9e}
J.~Magnus and H.~Neudecker.
\newblock {\em Matrix Differential Calculus with Applications in Statistics and
  Econometrics (Revised Edition)}.
\newblock John Wiley \& Sons Ltd, 1999.

\bibitem{Mangoubi19}
O.~{Mangoubi} and N.~K. {Vishnoi}.
\newblock Faster polytope rounding, sampling, and volume computation via a
  sub-linear ball walk.
\newblock In {\em Proc. IEEE Symp. Foundation of Comp. Science (FOCS)}, pages
  1338--1357, 2019.

\bibitem{Pakman14}
A.~Pakman and L.~Paninski.
\newblock Exact {Hamiltonian} {Monte} {Carlo} for {Truncated} {Multivariate}
  {Gaussians}.
\newblock {\em J. Computational \& Graphical Statistics}, 23(2):518--542, Apr.
  2014.

\bibitem{Pan-opt-usolve-02}
V.~Y. Pan.
\newblock Univariate polynomials: nearly optimal algorithms for numerical
  factorization and root-finding.
\newblock {\em J. Symbolic Computation}, 33(5):701--733, 2002.

\bibitem{PanTsi-refine-16}
V.~Y. Pan and E.~P. Tsigaridas.
\newblock Nearly optimal refinement of real roots of a univariate polynomial.
\newblock {\em J. Symbolic Computation}, 74:181--204, 2016.

\bibitem{POLYAK20146123}
B.~Polyak and E.~Gryazina.
\newblock Billiard walk - a new sampling algorithm for control and
  optimization.
\newblock {\em IFAC Proceedings Volumes}, 47(3):6123--6128, 2014.

\bibitem{Polyakdecomposition}
B.~Polyak and P.~Shcherbakov.
\newblock The {D}-decomposition technique for linear matrix inequalities.
\newblock {\em Automation and Remote Control}, 67:1847--1861, 11 2006.

\bibitem{Ramana99}
M.~Ramana and A.~Goldman.
\newblock Some geometric results in semidefinite programming.
\newblock {\em J. Global Optimization}, 7, 02 1999.

\bibitem{Ray93}
L.~R. Ray and R.~F. Stengel.
\newblock A monte carlo approach to the analysis of control system robustness.
\newblock {\em Automatica}, 29(1):229--236, 1993.

\bibitem{Schonhage-usolve}
A.~Sch{\"o}nhage.
\newblock The fundamental theorem of algebra in terms of computational
  complexity.
\newblock {\em Manuscript. Univ. of T{\"u}bingen, Germany}, 1982.

\bibitem{Smith84}
R.~L. Smith.
\newblock Efficient monte carlo procedures for generating points uniformly
  distributed over bounded regions.
\newblock {\em Operations Research}, 32(6):1296--1308, 1984.

\bibitem{Spectra}
Spectra.
\newblock A header-only {C++} library for large scale eigenvalue problems.
\newblock \url{https://spectralib.org}, 2020.
\newblock v0.9.0.

\bibitem{Tabachnikov2005GeometryAB}
S.~Tabachnikov.
\newblock {\em {Geometry and billiards}}.
\newblock Student mathematical library. American Mathematical Society,
  Providence, RI, 2005.

\bibitem{TCD-rc-bk-12}
R.~Tempo, G.~Calafiore, and F.~Dabbene.
\newblock {\em Randomized algorithms for analysis and control of uncertain
  systems: with applications}.
\newblock Springer, 2012.

\bibitem{Tis-becpep-2000}
F.~Tisseur.
\newblock Backward error and condition of polynomial eigenvalue problems.
\newblock {\em Linear Algebra \& Appl.}, 309(1):339--361, 2000.

\bibitem{Trefethen97}
L.~N. Trefethen and D.~Bau.
\newblock {\em Numerical linear algebra.}
\newblock SIAM, 1997.

\bibitem{Vempala05}
S.~Vempala.
\newblock Geometric random walks: A survey.
\newblock {\em Combinatorial \& Computational Geometry}, 52, 01 2005.

\bibitem{sdpa}
M.~Yamashita, K.~Fujisawa, and M.~Kojima.
\newblock Implementation and evaluation of sdpa 6.0.
\newblock {\em Optimization Methods \& Software}, 18(4):491--505, 2003.

\end{thebibliography}
