1. Abbasi-Yadkori Y, Bartlett P, Gabillon V, Malek A (2017) Hit-and-run for sampling and planning in non-convex spaces. In: Artificial intelligence and statistics, pp 888–895. PMLR
2. Berbee HCP, Boender CGE, Rinnooy Kan AHG, Scheffer CL, Smith RL, Telgen J (1987) Hit-and-run algorithms for the identification of nonredundant linear inequalities. Math Program 37:184–207
3. Birge JR, Smith RL (1984) Random procedures for nonredundant constraint identification in stochastic linear programs. Am J Math Manag Sci 4:41–70
4. Boneh A, Golan A (1979) Constraints’ redundancy and feasible region boundedness by random feasible point generator. In: Third European congress on operations research, EURO III, Amsterdam, 9–11 Apr 1979
5. Kalai AT, Vempala S (2006) Simulated annealing for convex optimization. Math Oper Res 31(2):253–266