Low‐complexity minimization algorithms (Q3599999): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063635964 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Numerical Optimization / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:51, 29 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low‐complexity minimization algorithms |
scientific article |
Statements
Low‐complexity minimization algorithms (English)
0 references
9 February 2009
0 references
unconstrained minimization
0 references
quasi-Newton method
0 references
matrix algebra
0 references
Broyden-Fletcher-Goldfarb-Shanno (BFGS) construction
0 references
complexity
0 references
updating algorithm
0 references
numerical examples
0 references
performance
0 references
