Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (Q1653949): Difference between revisions
From MaRDI portal
Latest revision as of 06:06, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme |
scientific article |
Statements
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (English)
0 references
7 August 2018
0 references
Summary: To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approach. It is shown that the suggested parameters guarantee the sufficient descent property independent to the line search and the objective function convexity. Furthermore, they ensure the global convergence of the related algorithm for uniformly convex objective functions. Using a set of unconstrained optimization test problems from the CUTEr library, effectiveness of the suggested choices are numerically compared with two other recently proposed adaptive choices. Results of comparisons show that one of the proposed choices is computationally promising in the sense of the Dolan-Moré performance profile.
0 references
unconstrained optimization
0 references
conjugate gradient method
0 references
sufficient descent property
0 references
penalty method
0 references
line search
0 references
0 references
0 references