An LP-based successive overrelaxation method for linear complementarity problems (Q1093555): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5608986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large, structured linear complementarity problems: the block partitioned case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual differentiable exact penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a basic iterative method for the implicit complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references