Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations (Q380457)
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: Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations |
scientific article; zbMATH DE number 6226861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations |
scientific article; zbMATH DE number 6226861 |
Statements
Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations (English)
0 references
14 November 2013
0 references
MPCC
0 references
MPCC-stationarity
0 references
Levenberg-Marquardt method
0 references
regularity
0 references
global convergence
0 references
