An asynchronous decomposition approach to parallel global optimization

DOI10.1016/S0893-9659(98)00011-1MaRDI QIDQ289341zbMATH OpenFDO

Authors R. F. Peierls, Yuefan Deng

Publication date 30 May 2016

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0893-9659(98)00011-1

zbMATH Keywords

asynchronousglobal optimizationLennard-Jones clustersparallel computingsimulated annealing

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4202044
• Parallel simulated annealing algorithms in global optimization
• A parallel algorithm for global optimization
• scientific article; zbMATH DE number 970355
• scientific article; zbMATH DE number 833650

Cites work

• Equation of state calculations by fast computing machines
• Global optima of Lennard-Jones clusters
• scientific article; zbMATH DE number 835705 (Why is no real title available?)
• Optimization by simulated annealing
• Slow annealing versus multiple fast annealing runs - an empirical investigation

Cited in

(3)

• Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems
• scientific article; zbMATH DE number 4202044 (Why is no real title available?)
• scientific article; zbMATH DE number 2114139 (Why is no real title available?)

This page was built for publication: An asynchronous decomposition approach to parallel global optimization

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