The following pages link to Hit-and-run mixes fast (Q1968791):
Displaying 50 items.
- The symplectic geometry of closed equilateral random walks in 3-space (Q259598) (← links)
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation (Q298374) (← links)
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints (Q314508) (← links)
- Elicitation of criteria importance weights through the Simos method: a robustness concern (Q319814) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Randomized methods based on new Monte Carlo schemes for control and optimization (Q666376) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- On the generation of random stable polynomials (Q719189) (← links)
- \(D\)-decomposition technique state-of-the-art (Q1003077) (← links)
- The interacting-particle algorithm with dynamic heating and cooling (Q1029697) (← links)
- Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model (Q1620578) (← links)
- Rank constrained distribution and moment computations (Q1658540) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints (Q1660636) (← links)
- Heuristics for selecting pair-wise elicitation questions in multiple criteria choice problems (Q1683102) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Approximating the tail of the Anderson-Darling distribution (Q1927213) (← links)
- Slow hit-and-run sampling (Q1975350) (← links)
- A systematic approach for examining the impact of calibration uncertainty in disease modeling (Q1989736) (← links)
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises (Q2096364) (← links)
- Oracle lower bounds for stochastic gradient sampling algorithms (Q2137007) (← links)
- Efficient computation of the stochastic behavior of partial sum processes (Q2184415) (← links)
- Hit and run as a unifying device (Q2197359) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- Dimensional reduction for latent scores modeling using recursive integration (Q2320784) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- On the computational complexity of MCMC-based estimators in large samples (Q2388988) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Heat-bath random walks with Markov bases (Q2407392) (← links)
- A Gibbs sampler on the \(n\)-simplex (Q2443187) (← links)
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces (Q2447735) (← links)
- Generating a random collection of discrete joint probability distributions subject to partial information (Q2513651) (← links)
- Multiobjective Interacting Particle Algorithm for Global Optimization (Q2940537) (← links)
- Asymptotic analysis of noisy fitness maximization, applied to metabolism & growth (Q3302510) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- (Q4558208) (← links)
- Comparison of hit-and-run, slice sampler and random walk Metropolis (Q4611278) (← links)
- (Q4637035) (← links)
- A Generalized Sampling Approach for Multilinear Utility Functions Given Partial Preference Information (Q4691976) (← links)
- (Q4969156) (← links)
- Multidimensional Binary Search for Contextual Decision-Making (Q4971566) (← links)
- Geodesic Walks in Polytopes (Q5073522) (← links)
- (Q5115786) (← links)
- Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions (Q5154639) (← links)
- (Q5214293) (← links)
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
