Show simple item record

dc.contributor.authorWu, Y
dc.contributor.authorOzdamar, L
dc.contributor.authorKumar, A
dc.date.accessioned2017-05-03T15:54:49Z
dc.date.available2017-05-03T15:54:49Z
dc.date.issued2005
dc.date.modified2011-02-15T12:54:32Z
dc.identifier.issn0377-0427
dc.identifier.doi10.1016/j.cam.2004.08.005
dc.identifier.urihttp://hdl.handle.net/10072/36209
dc.description.abstractWe propose a triangulation-based partitioning algorithm,TRIOPT, for solving low-dimensional bound-constrained black box global optimization problems. The method starts by forming a Delaunay triangulation of a given set of samples in the feasible domain, and then, it assesses the simplices (partitions) obtained for re-partitioning. Function values at the vertices of each partition are mapped into the zero one interval by a nonlinear transformation function and their aggregate entropy is calculated. Based on this entropy, partitions that hold a promise of containing the global optimum are re-partitioned according to different triangular splitting strategies, forming newpartitions. These strategies are efficient in terms of the number of new function evaluations required per new partition. A novelty in the search scheme proposed here is that once a partition narrows down to a small size, its vertices are eliminated from the available sample set. This changes global information on the best solution and triggers a re-calculation of transformed values. Hence, revised entropies change the direction of the search to new areas. The latter scheme leads to a dynamic parallel search policy which is based on an entropy cut. The tree adopts flexible breadth depending on the status of the search. In the experimental results it is demonstrated that TRIOPTs performance is compatible and often better than that of a well-known response surface methodology and two other efficient black box partitioning approaches proposed for global optimization.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherElsevier
dc.publisher.placeNetherlands
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom35
dc.relation.ispartofpageto53
dc.relation.ispartofjournalJournal of Computational and Applied Mathematics
dc.relation.ispartofvolume177
dc.rights.retentionY
dc.subject.fieldofresearchApplied mathematics
dc.subject.fieldofresearchNumerical and computational mathematics
dc.subject.fieldofresearchOptimisation
dc.subject.fieldofresearchcode4901
dc.subject.fieldofresearchcode4903
dc.subject.fieldofresearchcode490304
dc.titleTRIOPT: a triangulation-based partitioning algorithm for global optimization
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.date.issued2005
gro.hasfulltextNo Full Text
gro.griffith.authorWu, Yong


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record