Objective function features providing barriers to rapid global optimization

DOI10.1007/S10898-004-9965-1MaRDI QIDQ813354zbMATH OpenOpenAlexFDO

Authors M. G. R. Wood, Marco Locatelli

Publication date 8 February 2006

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-004-9965-1

zbMATH Keywords

Simulated annealingLocal minimaLocal optimizationSearch regionStochastic global optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15)

Recommendations

• Matching stochastic algorithms to objective function landscapes
• Stochastic global optimization methods part II: Multi level methods
• Optimising noisy objective functions
• Stochastic global optimization methods part I: Clustering methods
• scientific article; zbMATH DE number 433029

Cites work

• Checking local optimality in constrained quadratic programming is NP- hard
• Efficient simulated annealing on fractal energy landscapes
• Global optimization on funneling landscapes
• Physical Perspectives on the Global Optimization of Atomic Clusters
• The optimal geometry of Lennard-Jones clusters: 148-309
• Variable neighborhood search: Principles and applications

Cited in

(3)

• Study of multiscale global optimization based on parameter space partition
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Measuring instance difficulty for combinatorial optimization problems

This page was built for publication: Objective function features providing barriers to rapid global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813354)