Pattern discrete and mixed hit-and-run for global optimization
DOI10.1007/S10898-010-9534-8zbMATH Open1228.90005OpenAlexW2033718031MaRDI QIDQ645554FDOQ645554
Robert L. Smith, Yanfang Shen, Zelda B. Zabinsky, Huseyin Onur Mete, Seksan Kiatsupaibul
Publication date: 8 November 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9534-8
simulated annealingglobal optimizationstochastic optimizationMarkov chain Monte Carlo samplingadaptive search algorithmsimproving hit-and-run
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Analysis of algorithms (68W40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Introduction to Stochastic Search and Optimization
- Hit-and-run mixes fast
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Hit-and-Run from a Corner
- Solving convex programs by random walks
- Geometric bounds for eigenvalues of Markov chains
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Stochastic adaptive search for global optimization.
- Simulated annealing for constrained global optimization
- Mathematical Aspects of Mixing Times in Markov Chains
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Global optimization. Scientific and engineering case studies
- Simulated Annealing for Convex Optimization
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Improving hit-and-run for global optimization
- An analytically derived cooling schedule for simulated annealing
- Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
- Title not available (Why is that?)
- The interacting-particle algorithm with dynamic heating and cooling
- Stochastic methods for practical global optimization
- On the neighborhood structure of the traveling salesman problem generated by local search moves
Cited In (4)
Uses Software
This page was built for publication: Pattern discrete and mixed hit-and-run for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645554)
