A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808)
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 2130179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints |
scientific article; zbMATH DE number 2130179 |
Statements
A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (English)
0 references
19 January 2005
0 references
A new algorithm is proposed for solving mathematical programs with linear complementarity problems. The advantage of the new algorithm is that it is globally convergent without requiring strong assumptions such as nondegeneracy or linear independence condition. Numerical results show the effectiveness of the algorithm. The proofs of the results are nice pieces of fine analysis. The features of the paper constitute a valuable tool for researchers.
0 references
complementarity constraints
0 references
nondegeneracy condition
0 references
global convergence
0 references
algorithm
0 references
linear complementarity problems
0 references
numerical results
0 references
0 references
0 references
0 references
0.9299164
0 references
0 references
0.91256785
0 references
0.9111799
0 references
0.90966547
0 references
0.90703493
0 references
0.9019011
0 references
0.90177274
0 references
0.8998047
0 references
