Efficient hybrid methods for global continuous optimization based on simulated annealing
DOI10.1016/J.COR.2004.09.005zbMATH Open1079.90107OpenAlexW1978301563WikidataQ109314961 ScholiaQ109314961MaRDI QIDQ2571196FDOQ2571196
Authors: Marko M. Mäkelä, Heikki Maaranen, Kaisa Miettinen 
Publication date: 1 November 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.005
Recommendations
- scientific article; zbMATH DE number 854915
- Simulated annealing using hybrid Monte Carlo
- A new hybrid method for solving global optimization problem
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- New limited memory bundle method for large-scale nonsmooth optimization
- Global optimization of statistical functions with simulated annealing
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- Optimization by simulated annealing
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- Handbook of global optimization
- More test examples for nonlinear programming codes
- Simulated annealing: Practice versus theory
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Global optimization and simulated annealing
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Quasi-random initial population for genetic algorithms
- Title not available (Why is that?)
- Convergence of the simulated annealing algorithm for continuous global optimization
- Tabu search applied to global optimization
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- Global optimization and stochastic differential equations
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
- Aspiration based simulated annealing algorithm
- A novel metaheuristics approach for continuous global optimization
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Global optimizations and tabu search based on memory
- Experiments with new stochastic global optimization search techniques
- Continuous optimization by a variant of simulated annealing
Cited In (2)
Uses Software
This page was built for publication: Efficient hybrid methods for global continuous optimization based on simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571196)
