Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

An asynchronous decomposition approach to parallel global optimization

From MaRDI portal
Publication:289341
Jump to:navigation, search

DOI10.1016/S0893-9659(98)00011-1zbMath1337.90066MaRDI QIDQ289341

Yuefan Deng, Ronald F. Peierls

Publication date: 30 May 2016

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


zbMATH Keywords

global optimizationsimulated annealingparallel computingLennard-Jones clustersasynchronous


Mathematics Subject Classification ID

Nonlinear programming (90C30)





Cites Work

  • Unnamed Item
  • Optimization by Simulated Annealing
  • Global optima of Lennard-Jones clusters
  • Slow annealing versus multiple fast annealing runs - an empirical investigation
  • Equation of State Calculations by Fast Computing Machines




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:289341&oldid=12171606"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 02:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki