๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints

โœ Scribed by X. M. Hu; D. Ralph

Publisher
Springer
Year
2004
Tongue
English
Weight
166 KB
Volume
123
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Convergence analysis of an augmented Lag
Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints
โœ X.Q. Yang; X.X. Huang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

In this paper, a mathematical program with complementarity constraints (MPCC) is reformulated as a nonsmooth constrained optimization problem by using the Fischer-Burmeister function. An augmented (proximal) Lagrangian method is applied to tackle the resulting constrained optimization problem. The a

Modified relaxation method for mathemati
Modified relaxation method for mathematical programs with complementarity constraints
โœ Gui-Hua Lin ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

## Abstract In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper (__J. Opt. Theory Appl.__ 2003; **118**:81โ€“116). We show that the main results remai