Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems |
scientific article; zbMATH DE number 991113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems |
scientific article; zbMATH DE number 991113 |
Statements
Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (English)
0 references
17 September 1997
0 references
The author proposes a method for finding the best surrogates (nonnegative combinations) of violated inequalities while solving the systems of linear inequalities by the relaxation method. These surrogates may be used for accelerating various methods for convex feasibility and optimization problems.
0 references
monotone Gram matrices
0 references
deepest surrogate inequalities
0 references
accelerated relaxation methods
0 references
convex feasibility problems
0 references
systems of linear inequalities
0 references
0 references
0 references
0 references
0.7471049427986145
0 references
