A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

作者：Tang, Jingyong^*

来源：COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37(3): 3927-3936.

DOI：10.1007/s40314-017-0554-6

• Linear weighted complementarity problem
• Smoothing algorithm
• Inexact Newton method
• Nonmonotone line search

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634-1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

• 出版日期2018-7
• 单位信阳师范学院