A conjugate gradient algorithm for sparse linear inequalities (Q915387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4151745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A conjugate gradient algorithm for sparse linear inequalities |
scientific article; zbMATH DE number 4151745 |
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
0 references
0.93983865
0 references
0.9196857
0 references
0 references
0.9137769
0 references
0.9129304
0 references
0.9111558
0 references
0.9108466
0 references
0.90967333
0 references
