Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints |
scientific article |
Statements
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (English)
0 references
18 March 2013
0 references
The authors deal with convergence properties of five relaxation methods for solving mathematical programs with equilibrium constraints (MPECs). Several existed convergence results are improved and some new results regarding the satisfaction of standard constraint qualifications for the relaxed problems are obtained. They present a numerical comparison of these methods based on the MacMPEC test problem collection. Numerical results favour the oldest relaxation scheme due to Scholtes.
0 references
Mathematical program with complementarity constraints
0 references
relaxation method
0 references
global convergence
0 references
constraint qualification
0 references
comparison
0 references
