Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/89471
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gratton, Serge | - |
dc.contributor.author | Royer, Clément W | - |
dc.contributor.author | Vicente, Luís Nunes | - |
dc.date.accessioned | 2020-06-05T15:40:25Z | - |
dc.date.available | 2020-06-05T15:40:25Z | - |
dc.date.issued | 2020 | - |
dc.identifier.uri | https://hdl.handle.net/10316/89471 | - |
dc.description.abstract | In order to be provably convergent towards a second-order stationary point, optimization methods applied to nonconvex problems must necessarily exploit both first and second-order information. However, as revealed by recent complexity analyses of some of these methods, the overall effort to reach second-order points is significantly larger when compared to the one of approaching first-order ones. On the other hand, there are other algorithmic schemes, initially designed with first-order convergence in mind, that do not appear to maintain the same first-order performance when modified to take second-order information into account. In this paper, we propose a technique that separately computes first and second-order steps, and that globally converges to second-order stationary points: it consists in better connecting the steps to be taken and the stationarity criteria, potentially guaranteeing larger steps and decreases in the objective. Our approach is shown to lead to an improvement of the corresponding complexity bound with respect to the first-order optimality tolerance, while having a positive impact on the practical behavior. Although the applicability of our ideas is wider, we focus the presentation on trust-region methods with and without derivatives, and motivate in both cases the interest of our strategy. | pt |
dc.language.iso | eng | pt |
dc.publisher | Springer-Verlag | pt |
dc.relation | UID/MAT/00324/2013 | pt |
dc.rights | embargoedAccess | pt |
dc.title | A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds | pt |
dc.type | article | - |
degois.publication.firstPage | 195 | pt |
degois.publication.lastPage | 222 | pt |
degois.publication.title | Mathematical Programming | pt |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s10107-018-1328-7 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1007/s10107-018-1328-7 | pt |
degois.publication.volume | 179 | pt |
dc.date.embargo | 2020-12-31 | * |
uc.date.periodoEmbargo | 365 | pt |
item.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.openairetype | article | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.orcid | 0000-0002-5021-2357 | - |
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 | |
---|---|---|---|---|
decoupled.pdf | 469.79 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
5
checked on Apr 15, 2024
WEB OF SCIENCETM
Citations
10
5
checked on Apr 2, 2024
Page view(s)
186
checked on Apr 23, 2024
Download(s)
176
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.