Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) (Q911481)
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: Publication:911481 |
scientific article; zbMATH DE number 4141820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) |
scientific article; zbMATH DE number 4141820 |
Statements
Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) (English)
0 references
1990
0 references
A simplicial algorithm is developed to solve the nonlinear complementarity problem on \(S^ n\times R^ m_+\). Furthermore, a condition for convergence is formulated. The triangulation which underlies the algorithm is a combination of the V-triangulation of \(S^ n\) and the K-triangulation of \(R^ m_+\). Therefore, we will call it the VK-triangulation.
0 references
convergence condition
0 references
simplicial algorithm
0 references
nonlinear complementarity
0 references
V-triangulation
0 references
K-triangulation
0 references
VK-triangulation
0 references
0 references
0.8347147703170776
0 references
0.8199936151504517
0 references
0.812554121017456
0 references
