Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/11401
DC FieldValueLanguage
dc.contributor.authorCustódio, Ana Luísa-
dc.contributor.authorVicente, Luís Nunes-
dc.date.accessioned2009-09-14T15:03:34Z-
dc.date.available2009-09-14T15:03:34Z-
dc.date.issued2004-
dc.identifier.citationPré-Publicações DMUC. 04-35 (2004)en_US
dc.identifier.urihttp://hdl.handle.net/10316/11401-
dc.description.abstractPattern search methods can be made more efficient if past function evaluations are appropriately reused. In this paper we will introduce a number of ways of reusing previous evaluations of the objective function based on the computation of simplex derivatives (e.g., simplex gradients) to improve the efficiency of a pattern search iteration. At each iteration of a pattern search method, one can attempt to compute an accurate simplex gradient by identifying a sampling set of previous iterates with good geometrical properties. This simplex gradient computation can be done using only past successful iterates or by considering all past function evaluations. The simplex gradient can then be used, for instance, to reorder the evaluations of the objective function associated with the positive spanning set or positive basis used in the poll step. But it can also be used to update the mesh size parameter according to a sufficient decrease criterion. None of these modifications demands new function evaluations. A search step can also be tried along the negative simplex gradient at the beginning of the current pattern search iteration. We will present these procedures in detail and show how promising they are to enhance the practical performance of pattern search methods.en_US
dc.description.sponsorshipCentro de Matemática da Universidade de Coimbra; FCT, POCTI/35059/MAT/2000; Centro de Matemática e Aplicações da Universidade Nova da Lisboaen_US
dc.language.isoengen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.rightsopenAccessen_US
dc.subjectDerivative free optimizationen_US
dc.subjectPattern search methodsen_US
dc.subjectSimplex gradienten_US
dc.subjectSimplex Hessianen_US
dc.subjectMultivariate polynomial interpolationen_US
dc.subjectPoisednessen_US
dc.titleUsing sampling and simplex derivatives in pattern search methodsen_US
dc.typepreprinten_US
item.languageiso639-1en-
item.fulltextCom Texto completo-
item.grantfulltextopen-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Nacionais
Files in This Item:
File Description SizeFormat
Using sampling and simplex derivatives.pdf237.88 kBAdobe PDFView/Open
Show simple item record

Page view(s) 20

671
checked on Oct 21, 2020

Download(s)

163
checked on Oct 21, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.