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

Modified relaxation method for mathematical programs with complementarity constraints

โœ Scribed by Gui-Hua Lin

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
167 KB
Volume
30
Category
Article
ISSN
0170-4214

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 remain true for the modified method and particularly, some conditions assumed in the previous paper can be removed. Copyright ยฉ 2007 John Wiley & Sons, Ltd.

๐Ÿ“œ 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

An interior feasible direction method wi
An interior feasible direction method with constraint projections for linear programming
โœ J.A. Snyman ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 745 KB

A new feasible direction method for linear programming problems is presented. The method is not boundary following. The method proceeds from a feasible interior point in a direction that improves the objective function until a point on a constraint surface is met. At this point searches are initiate