Dynamic Data Structures for a Direct Search Algorithm

Simple item page
dc.contributor.authorHe, Jianen
dc.contributor.authorWatson, Layne T.en
dc.contributor.authorRamakrishnan, Narenen
dc.contributor.authorShaffer, Clifford A.en
dc.contributor.authorVerstak, Alexen
dc.contributor.authorJiang, Jingen
dc.contributor.authorBae, Kyungen
dc.contributor.authorTranter, William H.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:27Zen
dc.date.available2013-06-19T14:36:27Zen
dc.date.issued2001en
dc.description.abstractThe DIRECT (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (1993), a variant of Lipschitzian methods for bound constrained global optimization, has proved effective even in higher dimensions. However, the performance of a DIRECT implementation in real applications depends on the characteristics of the objective function, the problem dimension, and the desired solution accuracy. Implementations with static data structures often fail in practice, since it is difficult to predict memory resource requirements in advance. This is especially critical in multidisciplinary engineering design applications, where the DIRECT optimization is just one small component of a much larger computation, and any component failure aborts the entire design process. To make the DIRECT global optimization algorithm efficient and robust on large-scale, multidisciplinary engineering problems, a set of dynamic data structures is proposed here to balance the memory requirements with execution time, while simultaneously adapting to arbitrary problem size. The focus of this paper is on design issues of the dynamic data structures, and related memory management strategies. Numerical computing techniques and modifications of Jones’ original DIRECT algorithm in terms of stopping rules and box selection rules are also explored. Performance studies are done for synthetic test problems with multiple local optima. Results for application to a site-specific system simulator for wireless communications systems (S4W) are also presented to demonstrate the effectiveness of the proposed dynamic data structures for an implementation of DIRECT.en
dc.format.mimetypeapplication/postscripten
dc.identifierhttp://eprints.cs.vt.edu/archive/00000533/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000533/01/dirCOAP01.psen
dc.identifier.trnumberTR-01-09en
dc.identifier.urihttp://hdl.handle.net/10919/20057en
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.subjectAlgorithmsen
dc.subjectData structuresen
dc.titleDynamic Data Structures for a Direct Search Algorithmen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Name:
dirCOAP01.ps
Size:
1.59 MB
Format:
Postscript Files
Download

Collections

Computer Science Technical Reports