More test examples for nonlinear programming codes
More test examples for nonlinear programming codes
Proximity control in bundle methods for convex
Mathematical Programming: Series A and B
Nondifferentiable optimization
Optimization
Global optimization and simulated annealing
Mathematical Programming: Series A and B
Recent advances in global optimization
Recent advances in global optimization
Continuous optimization by a variant of simulated annealing
Computational Optimization and Applications
Enhanced simulated annealing for globally minimizing functions of many-continuous variables
ACM Transactions on Mathematical Software (TOMS)
Simulated annealing algorithms for continuous global optimization: convergence conditions
Journal of Optimization Theory and Applications
Convergence of the simulated annealing algorithm for continuous global optimization
Journal of Optimization Theory and Applications
Experiments with new stochastic global optimization search techniques
Computers and Operations Research
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
Aspiration Based Simulated Annealing Algorithm
Journal of Global Optimization
A novel metaheuristics approach for continuous global optimization
Journal of Global Optimization
Quasi-random initial population for genetic algorithms
Computers & Mathematics with Applications
A hybrid approach to modeling metabolic systems using a geneticalgorithm and simplex method
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Simulated annealing: Practice versus theory
Mathematical and Computer Modelling: An International Journal
Multiobjective Optimization
Solving Fuzzy Linear Regression with Hybrid Optimization
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Hybrid optimization with improved tabu search
Applied Soft Computing
Simulated annealing for optimal ship routing
Computers and Operations Research
Hi-index | 0.01 |
We introduce several hybrid methods for global continuous optimization. They combine simulated annealing and a local proximal bundle method. Traditionally, the simplest hybrid of a global and a local solver is to call the local solver after the global one, but this does not necessarily produce good results. Besides, using efficient gradient-based local solvers implies that the hybrid can only be applied to differentiable problems. We show several ways how to integrate the local solver as a genuine part of simulated annealing to enable both efficient and reliable solution processes. When using the proximal bundle method as a local solver, it is possible to solve even nondifferentiable problems. The numerical tests show that the hybridization can improve both the efficiency and the reliability of simulated annealing.