Improving hit-and-run for global optimization
From MaRDI portal
Publication:2366968
Recommendations
Cites work
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Extremal control by the method of random scanning
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 3598385 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3422188 (Why is no real title available?)
- scientific article; zbMATH DE number 3052987 (Why is no real title available?)
- scientific article; zbMATH DE number 3103824 (Why is no real title available?)
- Minimization by Random Search Techniques
- Optimized relative step size random searches
- Pure adaptive search in global optimization
- Pure adaptive search in Monte Carlo optimization
- Randomized Pattern Search
- 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
Cited in
(33)- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- Simulated annealing for constrained global optimization
- Simulated annealing for complex portfolio selection problems.
- Implementing pure adaptive search with Grover's quantum algorithm
- A direct stochastic algorithm for global search
- Towards pure adaptive search
- t-copula from the viewpoint of tail dependence matrices
- Stopping and restarting strategy for stochastic sequential search in global optimization
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Iterative MC-algorithm to solve the global optimization problems
- Solving fractional problems with dynamic multistart improving hit-and-run
- Single observation adaptive search for discrete and continuous stochastic optimization
- An optimal scaling to computationally tractable dimensionless models: study of latex particles morphology formation
- Adaptive parameterized improving hit-and-run for global optimization
- Pure random search with exponential rate of convergency
- Slow convergence of the Gibbs sampler
- Pattern hit-and-run for sampling efficiently on polytopes
- Single Observation Adaptive Search for Continuous Simulation Optimization
- A Hit‐and‐Run approach for generating scale invariant Small World networks
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- Exploring the space of perfectly balanced rhythms and scales
- Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
- Pattern discrete and mixed hit-and-run for global optimization
- A generalization of the Solis-Wets method
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- Matching stochastic algorithms to objective function landscapes
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- The multiple traveling salesmen problem with moving targets
- The vehicle routing problem with coupled time windows
- Adaptive search with stochastic acceptance probabilities for global optimization
This page was built for publication: Improving 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 Q2366968)
