Please use this identifier to cite or link to this item:
Title: A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
Authors: Gratton, Serge 
Royer, Clément W
Vicente, Luís Nunes 
Issue Date: 2020
Publisher: Springer-Verlag
Project: UID/MAT/00324/2013 
Serial title, monograph or event: Mathematical Programming
Volume: 179
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.
DOI: 10.1007/s10107-018-1328-7
Rights: embargoedAccess
Appears in Collections:I&D CMUC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
decoupled.pdf469.79 kBAdobe PDFView/Open
Show full item record

Citations 10

checked on Nov 2, 2021

Page view(s)

checked on Nov 26, 2021


checked on Nov 26, 2021

Google ScholarTM




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