Spectral three-term constrained conjugate gradient algorithm for function minimizations (Q2294136)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spectral three-term constrained conjugate gradient algorithm for function minimizations |
scientific article; zbMATH DE number 7165627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spectral three-term constrained conjugate gradient algorithm for function minimizations |
scientific article; zbMATH DE number 7165627 |
Statements
Spectral three-term constrained conjugate gradient algorithm for function minimizations (English)
0 references
10 February 2020
0 references
Summary: In this work, we tend to deal within the field of the constrained optimization methods of three-term Conjugate Gradient (CG) technique which is primarily based on Dai-Liao (DL) formula. The new proposed technique satisfies the conjugacy property and the descent conditions of Karush-Kuhn-Tucker (K.K.T.). Our planned constrained technique uses the robust Wolfe line search condition with some assumptions. We tend to prove the global convergence property of the new planned technique. Numeral comparisons for (30-thirty) constrained optimization issues make sure the effectiveness of the new planned formula.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8667030334472656
0 references
0.8594903349876404
0 references
0.8492586016654968
0 references
0.8388952016830444
0 references