The combination stretching function technique with simulated annealing algorithm for global optimization
From MaRDI portal
Publication:5746719
DOI10.1080/10556788.2013.838242zbMath1282.90100OpenAlexW2050198139MaRDI QIDQ5746719
Huiya Dai, Xue-li Song, Jun-qi He
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.838242
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Recent approaches to global optimization problems through particle Swarm optimization
- A simulated annealing driven multi-start algorithm for bound constrained global optimization
- A filled function method for finding a global minimizer of a function of several variables
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A hybrid descent method for global optimization
- The globally convexized filled functions for global optimization
- Objective function stretching to alleviate convergence to local minima.
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Infine functions and nonsmooth multiobjective optimization problems
- Coefficient estimation of IIR filter by a multiple crossover genetic algorithm
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- The Tunneling Algorithm for the Global Minimization of Functions
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
This page was built for publication: The combination stretching function technique with simulated annealing algorithm for global optimization
