Line search algorithms with guaranteed sufficient decrease (Q4371705): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q113310458 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TNPACK / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: L-BFGS / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 500 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091917610 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:28, 19 March 2024
scientific article; zbMATH DE number 1106150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Line search algorithms with guaranteed sufficient decrease |
scientific article; zbMATH DE number 1106150 |
Statements
Line search algorithms with guaranteed sufficient decrease (English)
0 references
25 January 1998
0 references
convergence
0 references
numerical examples
0 references
line search methods
0 references
search algorithm
0 references
