Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (Q1078096): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Normal solutions of linear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sparsity-preserving SOR algorithms for separable quadratic and linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661059 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs / rank | |||
Normal rank | |||
Latest revision as of 14:56, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs |
scientific article |
Statements
Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (English)
0 references
1987
0 references
A parallel successive overrelaxation (SOR) method is proposed for the solution of the fundamental symmetric linear complementarity problem. Convergence is established under a relaxation factor which approaches the classical value of 2 for a loosely coupled problem. The parallel SOR approach is then applied to solve the symmetric linear complementarity problem associated with the least norm solution of a linear program.
0 references
parallel algorithms
0 references
parallel successive overrelaxation
0 references
symmetric linear complementarity problem
0 references
