Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem (Q972943)
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: Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem |
scientific article; zbMATH DE number 5710905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem |
scientific article; zbMATH DE number 5710905 |
Statements
Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem (English)
0 references
21 May 2010
0 references
The convergence of two nonmonotone Levenberg-Marquardt algorithms for nonlinear complementarity problem is studied and proved. Under some mild assumptions, and requiring only the solution of a linear system at each iteration, the proposed nonmonotone Levenberg-Marquardt algorithms are shown to be globally convergent.
0 references
nonmonotone Levenberg-Marquardt algorithms
0 references
convergence
0 references
nonlinear complementarity problem
0 references
nonsmooth equations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8833944201469421
0 references
0.8609218001365662
0 references
0.8588203191757202
0 references
0.8470683097839355
0 references
0.8357775807380676
0 references
