A conjugate gradient algorithm for sparse linear inequalities (Q915387): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q587825 |
||
| Property / reviewed by | |||
| Property / reviewed by: Horst Hollatz / rank | |||
Revision as of 11:17, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjugate gradient algorithm for sparse linear inequalities |
scientific article |
Statements
A conjugate gradient algorithm for sparse linear inequalities (English)
0 references
1990
0 references
The author presents a conjugate gradient type method for solving a system of linear inequalities, which takes full advantage of the sparsity the problem may have. It is shown by numerical comparisons with the successive overrelaxation algorithm that this approach is attractive when a system has a relative large number of inequalities. The method works on two phases. Phase 1 either finds the minimum-norm solution of the system or detects the inconsistency. In phase 2 an approximate least-squares solution to the system is obtained.
0 references
conjugate gradient method
0 references
linear inequalities
0 references
sparsity
0 references
successive overrelaxation
0 references
minimum-norm solution
0 references
inconsistency
0 references
least-squares solution
0 references
