Derivative-free simulated annealing and deflecting function technique for global optimization

DOI10.1007/s12190-007-0010-7zbMath1279.90137OpenAlexW2017728710MaRDI QIDQ949241

Yong-Jun Wang

Publication date: 21 October 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-007-0010-7

zbMATH Keywords

global optimizationsimulated annealing (SA)deflecting function technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A multi-stage descent algorithm for discrete and continuous optimization applied to truss structures optimal design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Recent approaches to global optimization problems through particle Swarm optimization
• A quasi-Newton bundle method based on approximate subgradients
• A filled function method for finding a global minimizer of a function of several variables
• Global optimization and simulated annealing
• Objective function stretching to alleviate convergence to local minima.
• Application of chaos in simulated annealing
• A modification of gradient method of convex programming and its implementation
• Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
• Improved particle swarm optimization combined with chaos
• Bayesian stopping rules for multistart global optimization methods
• Taboo Search: An Approach to the Multiple Minima Problem
• The Tunneling Algorithm for the Global Minimization of Functions
• Stochastic global optimization methods part I: Clustering methods
• On Descent from Local Minima

This page was built for publication: Derivative-free simulated annealing and deflecting function technique for global optimization