Pattern discrete and mixed hit-and-run for global optimization

DOI10.1007/s10898-010-9534-8zbMath1228.90005OpenAlexW2033718031MaRDI QIDQ645554

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

zbMATH Keywords

global optimizationstochastic optimizationsimulated annealingMarkov chain Monte Carlo samplingadaptive search algorithmsimproving hit-and-run

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Single observation adaptive search for discrete and continuous stochastic optimization ⋮ Multiobjective Interacting Particle Algorithm for Global Optimization ⋮ Pattern hit-and-run for sampling efficiently on polytopes ⋮ An extended two-stage sequential optimization approach: properties and performance

Uses Software

• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Global optimization. Scientific and engineering case studies
• The interacting-particle algorithm with dynamic heating and cooling
• Stochastic methods for practical global optimization
• New reflection generator for simulated annealing in mixed-integer/continuous global optimization
• Simulated annealing for constrained global optimization
• Stochastic adaptive search for global optimization.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Hit-and-run mixes fast
• Improving hit-and-run for global optimization
• An analytically derived cooling schedule for simulated annealing
• On the neighborhood structure of the traveling salesman problem generated by local search moves
• Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Mathematical Aspects of Mixing Times in Markov Chains
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Introduction to Stochastic Search and Optimization
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Simulated Annealing for Convex Optimization
• Hit-and-Run from a Corner
• Solving convex programs by random walks
• Benchmarking optimization software with performance profiles.

This page was built for publication: Pattern discrete and mixed hit-and-run for global optimization