An asynchronous decomposition approach to parallel global optimization

DOI10.1016/S0893-9659(98)00011-1zbMATH Open1337.90066MaRDI QIDQ289341FDOQ289341

Authors: R. F. Peierls, Yuefan Deng 

Publication date: 30 May 2016

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

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
• Publication:4860122

zbMATH Keywords

simulated annealingglobal optimizationparallel computingasynchronousLennard-Jones clusters

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Optimization by simulated annealing
• Equation of state calculations by fast computing machines
• Global optima of Lennard-Jones clusters
• Slow annealing versus multiple fast annealing runs - an empirical investigation
• Title not available (Why is that?)

Cited In (2)

• Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems
• Title not available (Why is that?)

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)