A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (Q979319)
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 5726788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search |
scientific article; zbMATH DE number 5726788 |
Statements
A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (English)
0 references
25 June 2010
0 references
By using a non-monotone line search, the authors propose a non-monotone smoothing-type algorithm for solving a nonlinear complementarity problem. The proposed algorithm is shown to be globally and locally superlinearly convergent under standard assumptions. Some numerical results are presented to show the effectiveness of the algorithm.
0 references
nonlinear complementarity problems
0 references
non-monotone line search
0 references
smoothing-type algorithm
0 references
global convergence
0 references
superlinear convergence
0 references
numerical results
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9533167481422424
0 references
0.8615463376045227
0 references
0.8611648678779602
0 references
