An LP-based successive overrelaxation method for linear complementarity problems (Q1093555): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00938311 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W102562363 / rank | |||
Normal rank |
Latest revision as of 10:19, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An LP-based successive overrelaxation method for linear complementarity problems |
scientific article |
Statements
An LP-based successive overrelaxation method for linear complementarity problems (English)
0 references
1988
0 references
A sparsity preserving LP-based SOR method for solving classes of linear complementarity problems including the case where the given matrix is positive semidefinite is proposed. The LP subproblems need be solved only approximately by an SOR method. Heuristic enhancement is discussed. Numerical results for a special class of problems are presented, which show that the heuristic enhancement is very effective and the resulting program can solve problems of more than 100 variables in a few seconds even on a personal computer.
0 references
successive overrelaxation
0 references
0 references
0 references