Projective algorithms for solving complementarity problems (Q1607818)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1780322
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Projective algorithms for solving complementarity problems |
scientific article; zbMATH DE number 1780322 |
Statements
Projective algorithms for solving complementarity problems (English)
0 references
13 August 2002
0 references
The authors consider the linear complementarity problem: Given: An \(n\times n\) matrix \(A\) and a vector \(b\in \mathbb{R}^n\), find: \(w,x\in\mathbb{R}^n\) such that \[ w\geq 0,\;x\geq 0,\;w=Ax-,\;w^Tx=0. \] For this problem, robust projective algorithms of the von Neuman type are presented. Convergence conditions are given and numerical tests are presented.
0 references
numerical examples
0 references
linear complementarity problem
0 references
projective algorithms
0 references
0.8607015609741211
0 references
0.8460133671760559
0 references
0.8216676115989685
0 references
0.8203725814819336
0 references
