Hairer, E., Hochbruck, M., Iserles, A., and Lubich, C. Geometric numerical integration. Oberwolfach Reports, 3(1):805-882, 2006.
Heirendt, L., Arreckx, S., Pfau, T., Mendoza, S. N., Richelle, A., Heinken, A., Haraldsdóttir, H. S., Wachowiak, J., Keating, S. M., Vlasov, V., et al. Creation and analysis of biochemical constraint-based models using the COBRA Toolbox v. 3.0. Nature protocols, 14(3):639-702, 2019.
Kannan, R. and Narayanan, H. Random walks on polytopes and an affine interior point method for linear programming. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 561-570, 2009.
Kook, Y., Lee, Y.-T., Shen, R., and Vempala, S. Sampling with Riemannian Hamiltonian Monte Carlo in a constrained space. Advances in Neural Information Processing Systems, 35:31684-31696, 2022a.
Kook, Y., Lee, Y. T., Shen, R., and Vempala, S. S. Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integrators. arXiv preprint arXiv:2210.07219, 2022b.
Lan, S. and Shahbaba, B. Sampling constrained probability distributions using Spherical Augmentation. ArXiv e-prints, June 2015.
Lee, J. M. Riemannian Manifolds: an introduction to curvature, volume 176. Springer Science & Business Media, 2006.
Lee, Y. T. and Vempala, S. S. Eldan's stochastic localization and the KLS hyperplane conjecture: an improved lower bound for expansion. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 998-1007. IEEE, 2017a.
Lee, Y. T. and Vempala, S. S. Geodesic walks in polytopes. In Proceedings of the 49th Annual ACM SIGACT Symposium on theory of Computing, pp. 927-940, 2017b.
Lee, Y. T. and Vempala, S. S. Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1115-1121, 2018.
Leimkuhler, B. J. and Skeel, R. D. Symplectic numerical integrators in constrained Hamiltonian systems. Journal of Computational Physics, 112(1):117-125, 1994.
Lelièvre, T., Rousset, M., and Stoltz, G. Hybrid Monte Carlo methods for sampling probability measures on submanifolds. Numerische Mathematik, 143(2):379-421, 2019.
Lelièvre, T., Stoltz, G., and Zhang, W. Multiple projection Markov Chain Monte Carlo algorithms on submanifolds. IMA Journal of Numerical Analysis, 2022.
Lewis, N. E., Nagarajan, H., and Palsson, B. O. Constraining the metabolic genotype-phenotype relationship using a phylogeny of in silico methods. Nature Reviews Microbiology, 10(4):291-305, 2012.
Liu, J. S. Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Statistics and computing, 6:113-119, 1996.
Liu, J. S. and Liu, J. S. Monte Carlo strategies in scientific computing, volume 10. Springer, 2001.
Lovász, L. and Kannan, R. Faster mixing via average conductance. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 282-287. ACM, 1999.
Lovasz, L. and Simonovits, M. Random walks in a convex body and an improved volume algorithm. *Random structures & algorithms*, 4(4):359-412, 1993.
Lovász, L. and Vempala, S. Hit-and-run from a corner. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 310-314, 2004.