A smoothing Newton algorithm for mathematical programs with complementarity constraints

被引：10

作者：

Huang, Zheng-Hai ^{[1
]}

Sun, Jie

机构：

[1] Tianjin Univ, Sch Sci, Dept Math, Tianjin 300072, Peoples R China

[2] Natl Univ Singapore, Dept Decis Sci, Singapore 119260, Singapore

来源：

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2005年 / 1卷 / 02期

关键词：

mathematical program with complementarity constraints; B-stationary point; smoothing algorithm; global convergence;

D O I：

10.3934/jimo.2005.1.153

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We propose a smoothing Newton algorithm for solving mathematical programs with complementarity constraints (MPCCS). Under some reasonable conditions, the proposed algorithm is shown to be globally convergent and to generate a B-stationary point of the MPCC. Preliminary numerical results on some MacMPEC problems are reported.

引用

页码：153 / 170

页数：18

共 25 条

[21] A regularized smoothing Newton method for box constrained variational inequality problems with P0-functions [J].

Qi, HD .

SIAM JOURNAL ON OPTIMIZATION, 2000, 10 (02) :315-330

[22] Regularization of P0-functions in box variational inequality problems [J].

Ravindran, G ;

Gowda, MS .

SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (03) :748-760

[23] Exact penalization of mathematical programs with equilibrium constraints [J].

Scholtes, S ;

Stöhr, M .

SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1999, 37 (02) :617-652

[24] Convergence properties of a regularization scheme for mathematical programs with complementarity constraints [J].

Scholtes, S .

SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (04) :918-936

[25] Existence and limiting behavior of a non-interior-point trajectory for nonlinear complementarity problems without strict feasibility condition [J].

Zhao, YB ;

Li, D .

SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2001, 40 (03) :898-924

← 1 2 3 →