A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization (Q5106116)
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: A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization |
scientific article; zbMATH DE number 7586708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization |
scientific article; zbMATH DE number 7586708 |
Statements
A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization (English)
0 references
16 September 2022
0 references
conjugate gradient
0 references
line search
0 references
step length
0 references
steepest descent
0 references
optimization
0 references
0 references
0 references
