A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

被引:10
作者
Chen, Yu [1 ,3 ]
Wan, Zhong [1 ,2 ]
机构
[1] Cent S Univ, Sch Math & Stat, Changsha, Hunan, Peoples R China
[2] Cent S Univ, State Key Lab High Performance Complex Mfg, Changsha, Hunan, Peoples R China
[3] Guilin Univ Elect Technol, Sch Math & Comp Sci, Guilin, Peoples R China
基金
中国国家自然科学基金;
关键词
mathematical programs with complementarity constraints; constraints qualification; convergence; stationary point; UNCONSTRAINED OPTIMIZATION PROBLEMS; CONJUGATE-GRADIENT ALGORITHM; EQUILIBRIUM CONSTRAINTS; RELAXATION SCHEME; SQP METHODS; CONVERGENCE;
D O I
10.1017/S1446181115000048
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We propose a locally smoothing method for some mathematical programs with complementarity constraints, which only incurs a local perturbation on these constraints. For the approximate problem obtained from the smoothing method, we show that the Mangasarian-Fromovitz constraints qualification holds under certain conditions. We also analyse the convergence behaviour of the smoothing method, and present some sufficient conditions such that an accumulation point of a sequence of stationary points for the approximate problems is a C-stationary point, an M-stationary point or a strongly stationary point. Numerical experiments are employed to test the performance of the algorithm developed. The results obtained demonstrate that our algorithm is much more promising than the similar ones in the literature.
引用
收藏
页码:299 / 315
页数:17
相关论文
共 22 条
[1]  
[Anonymous], 1996, MATH PROGRAMS EQUILI, DOI DOI 10.1017/CBO9780511983658
[2]  
Clarke F.H, 1983, OPTIMIZATION NONSMOO
[3]   An Improved Spectral Conjugate Gradient Algorithm for Nonconvex Unconstrained Optimization Problems [J].
Deng, Songhai ;
Wan, Zhong ;
Chen, Xiaohong .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2013, 157 (03) :820-842
[4]   A smoothing method for mathematical programs with equilibrium constraints [J].
Facchinei, F ;
Jiang, HY ;
Qi, LQ .
MATHEMATICAL PROGRAMMING, 1999, 85 (01) :107-134
[5]   Local convergence of SQP methods for mathematical programs with equilibrium constraints [J].
Fletcher, R ;
Leyffer, S ;
Ralph, D ;
Scholtes, S .
SIAM JOURNAL ON OPTIMIZATION, 2006, 17 (01) :259-286
[6]  
Fukushima M, 1999, LECT NOTES ECON MATH, V477, P99
[7]   Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints [J].
Hoheisel, Tim ;
Kanzow, Christian ;
Schwartz, Alexandra .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :257-288
[8]   A new nonmonotone line search technique for unconstrained optimization [J].
Huang, Shuai ;
Wan, Zhong ;
Chen, Xiaohong .
NUMERICAL ALGORITHMS, 2015, 68 (04) :671-689
[9]   A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS [J].
Huang, Shuai ;
Wan, Zhong ;
Deng, Songhai .
ANZIAM JOURNAL, 2013, 54 (03) :143-152
[10]  
Leyffer S., 2000, Macmpec: Ampl collection of mpecs