Modified Jacobian smoothing method for nonsmooth complementarity problems

被引:0
作者
Pin-Bo Chen
Peng Zhang
Xide Zhu
Gui-Hua Lin
机构
[1] Shanghai University,School of Management
[2] Chongqing University of Posts and Telecommunications,School of Economics and Management
来源
Computational Optimization and Applications | 2020年 / 75卷
关键词
Nonsmooth complementarity problem; Jacobian consistency; Jacobian smoothing method; Convergence; Network Nash–Cournot game; 90C30; 90C33; 90C56;
D O I
暂无
中图分类号
学科分类号
摘要
This paper is devoted to solving a nonsmooth complementarity problem where the mapping is locally Lipschitz continuous but not continuously differentiable everywhere. We reformulate this nonsmooth complementarity problem as a system of nonsmooth equations with the max function and then propose an approximation to the reformulation by simultaneously smoothing the mapping and the max function. Based on the approximation, we present a modified Jacobian smoothing method for the nonsmooth complementarity problem. We show the Jacobian consistency of the function associated with the approximation, under which we establish the global and fast local convergence for the method under suitable assumptions. Finally, to show the effectiveness of the proposed method, we report our numerical experiments on some examples based on MCPLIB/GAMSLIB libraries or network Nash–Cournot game is proposed.
引用
收藏
页码:207 / 235
页数:28
相关论文
共 50 条
[41]   The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem [J].
Tang J. ;
Dong L. ;
Fang L. ;
Zhou J. .
Tang, J. (jingyongtang@163.com), 1600, Springer Verlag (43) :307-328
[42]   Improved smoothing Newton methods for P0 nonlinear complementarity problems [J].
Zhang, Liping ;
Wu, Soon-Yi ;
Gao, Tingran .
APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (01) :324-332
[43]   Smoothing penalty approach for solving second-order cone complementarity problems [J].
Nguyen, Chieu Thanh ;
Alcantara, Jan Harold ;
Hao, Zijun ;
Chen, Jein-Shan .
JOURNAL OF GLOBAL OPTIMIZATION, 2025, 91 (01) :39-58
[44]   A log-exponential smoothing method for mathematical programs with complementarity constraints [J].
Li, Yanyan ;
Tan, Tao ;
Li, Xingsi .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (10) :5900-5909
[45]   A smoothing conic trust region filter method for the nonlinear complementarity problem [J].
Zhou, Ying .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 229 (01) :248-263
[46]   An inexact smoothing method for the monotone complementarity problem over symmetric cones [J].
Zhang, Jian ;
Zhang, Kecun .
OPTIMIZATION METHODS & SOFTWARE, 2012, 27 (03) :445-459
[47]   A smoothing Newton method for the second-order cone complementarity problem [J].
Tang, Jingyong ;
He, Guoping ;
Dong, Li ;
Fang, Liang ;
Zhou, Jinchuan .
APPLICATIONS OF MATHEMATICS, 2013, 58 (02) :223-247
[48]   A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems [J].
Zheng, Hua ;
Vong, Seakweng .
NUMERICAL ALGORITHMS, 2019, 82 (02) :573-592
[49]   Smoothing methods for nonsmooth, nonconvex minimization [J].
Chen, Xiaojun .
MATHEMATICAL PROGRAMMING, 2012, 134 (01) :71-99
[50]   A note on the MSMAOR method for linear complementarity problems [J].
Wu, Shi-Liang ;
Li, Cui-Xia .
LINEAR & MULTILINEAR ALGEBRA, 2016, 64 (04) :795-800