Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
From MaRDI portal
Publication:2781135
DOI10.1287/opre.46.1.84zbMath1009.62597OpenAlexW2119642783WikidataQ114871074 ScholiaQ114871074MaRDI QIDQ2781135
David E. Kaufman, Robert L. Smith
Publication date: 5 May 2003
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.1.84
Related Items (11)
Simulated annealing for constrained global optimization ⋮ Exploring stochasticity and imprecise knowledge based on linear inequality constraints ⋮ General hit-and-run Monte Carlo sampling for evaluating multidimensional integrals ⋮ Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization ⋮ Single observation adaptive search for discrete and continuous stochastic optimization ⋮ Slice sampling. (With discussions and rejoinder) ⋮ Comparison of hit-and-run, slice sampler and random walk Metropolis ⋮ Multi-objective optimization using statistical models ⋮ Randomized methods based on new Monte Carlo schemes for control and optimization ⋮ Pure Random Search with exponential rate of convergency ⋮ Black-Box Optimization: Methods and Applications
This page was built for publication: Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
