The method of steepest descent for non-linear minimization problems (Q5840776): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q90314523 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/qam/10667 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2567576169 / rank | |||
Normal rank | |||
Latest revision as of 00:05, 20 March 2024
scientific article; zbMATH DE number 3101108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The method of steepest descent for non-linear minimization problems |
scientific article; zbMATH DE number 3101108 |
Statements
The method of steepest descent for non-linear minimization problems (English)
0 references
1944
0 references
numerical analysis
0 references
