An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm (Q1237502): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5543516 / rank | |||
Normal rank | |||
Latest revision as of 21:24, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm |
scientific article |
Statements
An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm (English)
0 references
1977
0 references
