OFFO minimization algorithms for second-order optimality and their complexity

S. Gratton () and Ph. L. Toint ()
Additional contact information
S. Gratton: Université de Toulouse
Ph. L. Toint: University of Namur

Computational Optimization and Applications, 2023, vol. 84, issue 2, No 10, 573-607

Abstract: Abstract An Adagrad-inspired class of algorithms for smooth unconstrained optimization is presented in which the objective function is never evaluated and yet the gradient norms decrease at least as fast as $$\mathcal{O}(1/\sqrt{k+1})$$ O ( 1 / k + 1 ) while second-order optimality measures converge to zero at least as fast as $$\mathcal{O}(1/(k+1)^{1/3})$$ O ( 1 / ( k + 1 ) 1 / 3 ) . This latter rate of convergence is shown to be essentially sharp and is identical to that known for more standard algorithms (like trust-region or adaptive-regularization methods) using both function and derivatives’ evaluations. A related “divergent stepsize” method is also described, whose essentially sharp rate of convergence is slighly inferior. It is finally discussed how to obtain weaker second-order optimality guarantees at a (much) reduced computational cost.

Keywords: Second-order optimality; Objective-function-free optimization (OFFO); Adagrad; Global rate of convergence; Evaluation complexity (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00435-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:84:y:2023:i:2:d:10.1007_s10589-022-00435-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-022-00435-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().