Parallel Deterministic and Stochastic Global Minimization of Functions with Very Many Minima

Simple item page
dc.contributor.authorEasterling, David R.en
dc.contributor.authorWatson, Layne T.en
dc.contributor.authorMadigan, Michael L.en
dc.contributor.authorCastle, Brent S.en
dc.contributor.authorTrosset, Michael W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:08Zen
dc.date.available2013-06-19T14:36:08Zen
dc.date.issued2011en
dc.description.abstractThe optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm developed at Indiana University.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00001167/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00001167/01/dirCOAP10c.pdfen
dc.identifier.trnumberTR-11-19en
dc.identifier.urihttp://hdl.handle.net/10919/19395en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectNumerical analysisen
dc.subjectParallel computationen
dc.titleParallel Deterministic and Stochastic Global Minimization of Functions with Very Many Minimaen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
dirCOAP10c.pdf
Size:
301.78 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports