A Double-Parameter Scaling Broyden–Fletcher–Goldfarb–Shanno Method Based on Minimizing the Measure Function of Byrd and Nocedal for Unconstrained Optimization

In this paper, the first two terms on the right-hand side of the Broyden–Fletcher–Goldfarb–Shanno update are scaled with a positive parameter, while the third one is also scaled with another positive parameter. These scaling parameters are determined by minimizing the measure function introduced by...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of optimization theory and applications Jg. 178; H. 1; S. 191 - 218
1. Verfasser: Andrei, Neculai
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.07.2018
Springer Nature B.V
Schlagworte:
Algorithms
Applications of Mathematics
Calculus of Variations and Optimal Control; Optimization
Clustering
Eigenvalues
Engineering
Iterative methods
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Parameters
Scaling
Theory of Computation
49M10
Scaling BFGS method
Global convergence
Measure function of Byrd and Nocedal
65K05
90C30
Numerical comparisons
49M7
Nonlinear programming
ISSN:0022-3239, 1573-2878
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, the first two terms on the right-hand side of the Broyden–Fletcher–Goldfarb–Shanno update are scaled with a positive parameter, while the third one is also scaled with another positive parameter. These scaling parameters are determined by minimizing the measure function introduced by Byrd and Nocedal (SIAM J Numer Anal 26:727–739, 1989 ). The obtained algorithm is close to the algorithm based on clustering the eigenvalues of the Broyden–Fletcher–Goldfarb–Shanno approximation of the Hessian and on shifting its large eigenvalues to the left, but it is not superior to it. Under classical assumptions, the convergence is proved by using the trace and the determinant of the iteration matrix. By using a set of 80 unconstrained optimization test problems, it is proved that the algorithm minimizing the measure function of Byrd and Nocedal is more efficient and more robust than some other scaling Broyden–Fletcher–Goldfarb–Shanno algorithms, including the variants of Biggs (J Inst Math Appl 12:337–338, 1973 ), Yuan (IMA J Numer Anal 11:325–332, 1991 ), Oren and Luenberger (Manag Sci 20:845–862, 1974 ) and of Nocedal and Yuan (Math Program 61:19–37, 1993 ). However, it is less efficient than the algorithms based on clustering the eigenvalues of the iteration matrix and on shifting its large eigenvalues to the left, as shown by Andrei (J Comput Appl Math 332:26–44, 2018 , Numer Algorithms 77:413–432, 2018 ).
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-018-1288-3