排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
In this paper, we present a new relaxation method for mathematical programs with complementarity constraints. Based on the fact that a variational inequality problem defined on a simplex can be represented by a finite number of inequalities, we use an expansive simplex instead of the nonnegative orthant involved in the complementarity constraints. We then remove some inequalities and obtain a standard nonlinear program. We show that the linear independence constraint qualification or the Mangasarian–Fromovitz constraint qualification holds for the relaxed problem under some mild conditions. We consider also a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is a weakly stationary point of the original problem and that, if the function involved in the complementarity constraints does not vanish at this point, it is C-stationary. We obtain also some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices of the Lagrangian functions of the relaxed problems are new and can be verified easily. Our limited numerical experience indicates that the proposed approach is promising. 相似文献
2.
We consider a mathematical program with complementarity constraints (MPCC). Our purpose is to develop methods that enable
us to compute a solution or a point with some kind of stationarity to MPCC by solving a finite number of nonlinear programs.
We apply an active set identification technique to a smoothing continuation method (Ref. 1) and propose a hybrid algorithm
for solving MPCC. We develop also two modifications: one makes use of an index addition strategy; the other adopts an index
subtraction strategy. We show that, under reasonable assumptions, all the proposed algorithms possess a finite termination
property. Further discussions and numerical experience are given as well
This work was supported in part by the Scientific Research Grant-in-Aid from the Ministry of Education, Science, Sports, and
Culture of Japan. The authors are grateful to Professor Paul Tseng for helpful suggestions on an earlier version of the paper. 相似文献
3.
Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints 总被引:5,自引:0,他引:5
We adapt the convergence analysis of the smoothing (Ref. 1) and regularization (Ref. 2) methods to a penalty framework for mathematical programs with complementarity constraints (MPCC); we show that the penalty framework shares convergence properties similar to those of these methods. Moreover, we give sufficient conditions for a sequence generated by the penalty framework to be attracted to a B-stationary point of the MPCC. 相似文献
4.
1