Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/45707
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vicente, Luís Nunes | - |
dc.date.accessioned | 2018-01-04T15:08:54Z | - |
dc.date.issued | 2013 | - |
dc.identifier.uri | https://hdl.handle.net/10316/45707 | - |
dc.description.abstract | In this paper, we prove that the broad class of direct-search methods of directional type based on imposing sufficient decrease to accept new iterates shares the worst case complexity bound of steepest descent for the unconstrained minimization of a smooth function, more precisely that the number of iterations needed to reduce the norm of the gradient of the objective function below a certain threshold is at most proportional to the inverse of the threshold squared. In direct-search methods, the objective function is evaluated, at each iteration, at a finite number of points. No derivatives are required. The action of declaring an iteration successful (moving into a point of lower objective function value) or unsuccessful (staying at the same iterate) is based on objective function value comparisons. Some of these methods are directional in the sense of moving along predefined directions along which the objective function will eventually decrease for sufficiently small step sizes. The worst case complexity bounds derived measure the maximum number of iterations as well as the maximum number of objective function evaluations required to find a point with a required norm of the gradient of the objective function, and are proved for such directional direct-search methods when a sufficient decrease condition based on the size of the steps is imposed to accept new iterates. | por |
dc.language.iso | eng | por |
dc.publisher | Springer-Verlag | por |
dc.relation | PEst-C/MAT/UI0324/2011 | por |
dc.rights | embargoedAccess | - |
dc.title | Worst case complexity of direct search | por |
dc.type | article | - |
degois.publication.firstPage | 143 | por |
degois.publication.lastPage | 153 | por |
degois.publication.issue | 1-2 | por |
degois.publication.title | EURO Journal on Computational Optimization | por |
dc.relation.publisherversion | https://doi.org/10.1007/s13675-012-0003-7 | por |
dc.peerreviewed | yes | por |
dc.identifier.doi | 10.1007/s13675-012-0003-7 | por |
degois.publication.volume | 1 | por |
dc.date.embargo | 2019-01-04T15:08:54Z | - |
item.openairetype | article | - |
item.fulltext | Com Texto completo | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.orcid | 0000-0003-1097-6384 | - |
Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
complex.pdf | 243.7 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
50
checked on Jul 15, 2024
WEB OF SCIENCETM
Citations
5
45
checked on Jul 2, 2024
Page view(s) 50
464
checked on Jul 16, 2024
Download(s)
166
checked on Jul 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.