Reflection, Refraction, and Hamiltonian Monte Carlo, Proceedings of the 28th International Conference on Neural Information Processing Systems, vol.2, pp.3007-3015, 2015. ,
The polynomial eigenvalue problem is well conditioned for random inputs, SIMAX, vol.40, issue.1, pp.175-193, 2019. ,
The real polynomial eigenvalue problem is well conditioned on the average. FoCM, pp.1-19, 2019. ,
The polynomial eigenvalue problem, 2005. ,
A conceptual introduction to hamiltonian monte carlo, 2017. ,
A survey of computational complexity results in systems and control, Automatica, vol.36, issue.9, pp.1249-1274, 2000. ,
Effective computational geometry for curves and surfaces, 2006. ,
Exact volume computation for polytopes: A practical study, 1998. ,
Random walks for probabilistic robustness, Proc. CDC, vol.5, pp.5316-5321, 2004. ,
Robust convex programs: Randomized solutions and applications in control, Proc. CDC, vol.3, pp.2423-2428, 2003. ,
Practical volume estimation by a new annealing schedule for cooling convex bodies, 2019. ,
Vaidya walk: A sampling algorithm based on the volumetric barrier, 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.1220-1227, 2017. ,
Hamiltonian Monte Carlo with boundary reflections, and application to polytope volume calculations, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01919855
Bypassing KLS: Gaussian cooling and an O * (n 3 ) volume algorithm, Proc. ACM STOC, pp.539-548, 2015. ,
A practical volume algorithm, Mathematical Programming Computation, vol.8, 2016. ,
A randomized cutting plane method with probabilistic geometric convergence, SIOPT, vol.20, pp.3185-3207, 2010. ,
Perturbation theory for homogeneous polynomial eigenvalue problems. Linear algebra and its applications, vol.358, pp.71-94, 2003. ,
A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM, vol.38, issue.1, pp.1-17, 1991. ,
, , 2015.
Practical polytope volume approximation, Prelim. version: SoCG, vol.44, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01897272
Separation bounds for polynomial systems, Journal of Symbolic Computation, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01105276
Random sampling: Billiard walk algorithm, European Journal of Operational Research, vol.238, 2012. ,
Eigen v3, 2010. ,
Approximate volume and integration for basic semialgebraic sets, SIAM review, vol.51, issue.4, pp.722-743, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00297384
Simulated annealing for convex optimization, Math. Oper. Res, vol.31, issue.2, pp.253-266, 2006. ,
On the complexity of computing determinants, Computational complexity, vol.13, issue.3-4, pp.91-130, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-02102099
Randomized algorithms for robust control analysis and synthesis have polynomial complexity, Proceedings of 35th IEEE Conference on Decision and Control, vol.3, pp.3470-3475, 1996. ,
Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets, Optimization Letters, vol.12, issue.3, pp.435-442, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01415327
Computing the volume of compact semi-algebraic sets, Proc. ISSAC, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02110556
Spherical Hamiltonian Monte Carlo for Constrained Target Distributions, JMLR workshop and conf procs, vol.32, pp.629-637, 2014. ,
On the complexity of the Lickteig-Roy subresultant algorithm, Journal of Symbolic Computation, vol.92, pp.243-268, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01450869
Algorithmic theory of odes and sampling from well-conditioned logconcave densities, 2018. ,
Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation, Proc. STOC, 2018. ,
Sylvester-habicht sequences and fast cauchy index computation, Journal of Symbolic Computation, vol.31, issue.3, pp.315-341, 2001. ,
Random walks and an O * (n 5 ) volume algorithm for convex bodies, Random Structures and Algorithms, vol.11, pp.1-50, 1997. ,
Simulated annealing in convex bodies and an O * (n 4 ) volume algorithm, Proc. FOCS, pp.650-659, 2003. ,
Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization, Proc. FOCS, pp.57-68, 2006. ,
, Matrix Differential Calculus with Applications in Statistics and Econometrics, 1999.
Faster polytope rounding, sampling, and volume computation via a sub-linear ball walk, Proc. FOCS, pp.1338-1357, 2019. ,
Exact Hamiltonian Monte Carlo for Truncated Multivariate Gaussians, Journal of Computational and Graphical Statistics, vol.23, issue.2, pp.518-542, 2014. ,
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding, J. of Symbolic Computation, vol.33, issue.5, pp.701-733, 2002. ,
Nearly optimal refinement of real roots of a univariate polynomial, Journal of Symbolic Computation, vol.74, pp.181-204, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00960896
Billiard walk -a new sampling algorithm for control and optimization, IFAC Proceedings Volumes, vol.47, pp.6123-6128, 2014. ,
The d-decomposition technique for linear matrix inequalities. Automation and Remote Control, vol.67, pp.1847-1861, 2006. ,
Some geometric results in semidefinite programming, Journal of Global Optimization, vol.7, 1999. ,
A monte carlo approach to the analysis of control system robustness, Automatica, vol.29, issue.1, pp.229-236, 1993. ,
The fundamental theorem of algebra in terms of computational complexity, 1982. ,
Efficient monte carlo procedures for generating points uniformly distributed over bounded regions, Operations Research, vol.32, issue.6, pp.1296-1308, 1984. ,
Geometry and billiards. Student mathematical library, 2005. ,
Randomized algorithms for analysis and control of uncertain systems: with applications, 2012. ,
Backward error and condition of polynomial eigenvalue problems, Linear Algebra and its Applications, vol.309, issue.1, pp.339-361, 2000. ,
The quadratic eigenvalue problem, SIAM review, vol.43, issue.2, pp.235-286, 2001. ,
Numerical linear algebra, 1997. ,
Geometric random walks: A survey, Combinatorial and Computational Geometry MSRI Publications, p.52, 2005. ,
Implementation and evaluation of sdpa 6.0. Optimization Methods and Software, vol.18, pp.491-505, 2003. ,