Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/13699
DC FieldValueLanguage
dc.contributor.authorVicente, L. N.-
dc.date.accessioned2010-08-24T12:45:50Z-
dc.date.available2010-08-24T12:45:50Z-
dc.date.issued2010-
dc.identifier.citationPré-Publicações DMUC. 10-17 (2010)en_US
dc.identifier.urihttp://hdl.handle.net/10316/13699-
dc.description.abstractIn this paper we prove that direct search of directional type shares the worst case complexity bound of steepest descent when sufficient decrease is imposed using a quadratic function of the step size parameter. This result is proved under smoothness of the objective function and using a framework of the type of GSS (generating set search). We also discuss the worst case complexity of direct search when only simple decrease is imposed and when the objective function is non-smooth.en_US
dc.language.isoengen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.rightsopenAccessen_US
dc.subjectDerivative-free optimizationen_US
dc.subjectDirect searchen_US
dc.subjectWorst case complexityen_US
dc.subjectSufficient decreaseen_US
dc.titleWorst case complexity of direct searchen_US
dc.typepreprinten_US
degois.publication.issue10-17en_US
degois.publication.locationCoimbraen_US
degois.publication.titlePré-Publicações DMUCen_US
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
Appears in Collections:FCTUC Matemática - Vários
Files in This Item:
File Description SizeFormat
Worst case complexity of direct search.pdf167.64 kBAdobe PDFView/Open
Show simple item record

Page view(s) 50

239
checked on Aug 20, 2019

Download(s)

34
checked on Aug 20, 2019

Google ScholarTM

Check


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