An automatic relaxation method for solving interval linear inequalities (Q1060533): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q203498 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Jan Mandel / rank | |||
Normal rank | |||
Revision as of 23:46, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An automatic relaxation method for solving interval linear inequalities |
scientific article |
Statements
An automatic relaxation method for solving interval linear inequalities (English)
0 references
1985
0 references
An iterative method for large sparse systems of interval linear inequalities is proposed. Each step consists of the orthogonal projection onto one of the defining hyperslabs, modified by an automatically generated relaxation parameter. This can be interpreted as a subgradient projection method for a suitable nonlinear problem, which proves convergence.
0 references
image reconstruction
0 references
interval linear inequalities
0 references
interval arithmetic
0 references
large sparse systems
0 references
subgradient projection method
0 references
