The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches (Q5948829): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q126459532, #quickstatements; #temporary_batch_1723827951581 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3134873 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Function minimization by conjugate gradients / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5563083 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3671858 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126459532 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:34, 16 August 2024
scientific article; zbMATH DE number 1672053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches |
scientific article; zbMATH DE number 1672053 |
Statements
The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches (English)
0 references
12 November 2001
0 references
unconstrained minimization
0 references
steepest descent
0 references
ill-conditioning
0 references
