Memoryless quasi-Newton-type methods via some weak secant relations for large-scale unconstrained optimization

This article presents two variants of memoryless quasi-Newton methods with backtracking line search for large-scale unconstrained minimization. These updating methods are derived by means of a least-change updating strategy subjected to some weaker form of secant relation obtained by projecting the...

Full description

Saved in:
Bibliographic Details
Published inJournal of inequalities and applications Vol. 2024; no. 1; pp. 155 - 17
Main Authors Lim, Keat Hee, Leong, Wah June
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 05.12.2024
Springer Nature B.V
SpringerOpen
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This article presents two variants of memoryless quasi-Newton methods with backtracking line search for large-scale unconstrained minimization. These updating methods are derived by means of a least-change updating strategy subjected to some weaker form of secant relation obtained by projecting the secant equation onto the search direction. In such a setting, the search direction can be computed without the need of calculation and storage of matrices. We establish the convergence properties for these methods, and their performance is tested on a large set of test functions by comparing with standard methods of similar computational cost and storage requirement. Our numerical results indicate that significant improvement has been achieved with respect to iteration counts and number of function evaluations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1029-242X
1025-5834
1029-242X
DOI:10.1186/s13660-024-03240-z