A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (Q6086842): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.apnum.2023.08.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APNUM.2023.08.006 / rank | |||
Normal rank | |||
Latest revision as of 18:18, 30 December 2024
scientific article; zbMATH DE number 7763841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem |
scientific article; zbMATH DE number 7763841 |
Statements
A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (English)
0 references
10 November 2023
0 references
sufficient descent
0 references
global convergence
0 references
complexity guarantees
0 references
Wolfe line search
0 references
Armijo line search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
