New reflection generator for simulated annealing in mixed-integer/continuous global optimization
DOI10.1023/A:1021745728358zbMATH Open0946.90055OpenAlexW1589670391MaRDI QIDQ1291825FDOQ1291825
Authors: H. Edwin Romeijn, Zelda B. Zabinsky, D. L. Graesser, S. Neogi 
Publication date: 30 October 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021745728358
Recommendations
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- scientific article; zbMATH DE number 1857675
- Global optimization and simulated annealing
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pure adaptive search in global optimization
- Title not available (Why is that?)
- Simulated annealing for constrained global optimization
- Elements of structural optimization.
- Improving hit-and-run for global optimization
- Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing
- Title not available (Why is that?)
- Estimation of the Minimum of a Function Using Order Statistics
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- Nonlinear Programming: A Numerical Survey
Cited In (6)
- A trust-region-based derivative free algorithm for mixed integer programming
- Pattern hit-and-run for sampling efficiently on polytopes
- Pattern discrete and mixed hit-and-run for global optimization
- Pure random search with exponential rate of convergency
- Two aspects of optimal diet determination for pig production: Efficiency of solution and incorporation of cost variation
- Adaptive search with stochastic acceptance probabilities for global optimization
Uses Software
This page was built for publication: New reflection generator for simulated annealing in mixed-integer/continuous global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291825)
