Improving hit-and-run for global optimization

DOI10.1007/BF01096737zbMath0784.90084OpenAlexW2100766205MaRDI QIDQ2366968

H. Edwin Romeijn, David E. Kaufman, Robert L. Smith, J. Fred McDonald, Zelda B. Zabinsky

Publication date: 15 August 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096737

zbMATH Keywords

global optimizationMonte Carlo optimizationrandom searchHit-and-Run

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Application of Bayesian approach to numerical methods of global and stochastic optimization, Simulated annealing for constrained global optimization, \(t\)-copula from the viewpoint of tail dependence matrices, Towards pure adaptive search, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Iterative MC-algorithm to solve the global optimization problems, Single observation adaptive search for discrete and continuous stochastic optimization, The multiple traveling salesmen problem with moving targets, Simulated annealing for complex portfolio selection problems., Implementing pure adaptive search with Grover's quantum algorithm, Pattern hit-and-run for sampling efficiently on polytopes, A direct stochastic algorithm for global search, An optimal scaling to computationally tractable dimensionless models: study of latex particles morphology formation, Exploring the space of perfectly balanced rhythms and scales, Pattern discrete and mixed hit-and-run for global optimization, Single Observation Adaptive Search for Continuous Simulation Optimization, A generalization of the Solis-Wets method, The vehicle routing problem with coupled time windows, Pure Random Search with exponential rate of convergency, Adaptive search with stochastic acceptance probabilities for global optimization, Solving fractional problems with dynamic multistart improving hit-and-run, CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method, Stopping and restarting strategy for stochastic sequential search in global optimization, A Hit‐and‐Run approach for generating scale invariant Small World networks, Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization, New reflection generator for simulated annealing in mixed-integer/continuous global optimization, Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Slow convergence of the Gibbs sampler, Matching stochastic algorithms to objective function landscapes, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal control by the method of random scanning
• Pure adaptive search in Monte Carlo optimization
• Pure adaptive search in global optimization
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Table errata: Table of integrals, series and products [English translation of the fourth Russian edition, Academic Press, New York, 1965; MR 33 #5952 by I. S. Gradšteĭn and I. M. Ryžik]
• Minimization by Random Search Techniques
• Optimized relative step size random searches
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Randomized Pattern Search