A smoothing Newton algorithm for weighted linear complementarity problem

被引:35
|
作者
Jian, Zhang [1 ]
机构
[1] Changan Univ, Sch Sci, Xian 710064, Peoples R China
关键词
Weighted linear complementarity problem; Smoothing Newton method; Locally quadratic convergence; CONVERGENCE; P-0; NCP;
D O I
10.1007/s11590-015-0877-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we present a new smoothing Newton method for solving monotone weighted linear complementarity problem (WCP). Our algorithm needs only to solve one linear system of equation and performs one line search per iteration. Any accumulation point of the iteration sequence generated by our algorithm is a solution of WCP. Under suitable conditions, our algorithm has local quadratic convergence rate. Numerical experiments show the feasibility and efficiency of the algorithm.
引用
收藏
页码:499 / 509
页数:11
相关论文
共 50 条
  • [41] A smoothing Newton method for the second-order cone complementarity problem
    Tang, Jingyong
    He, Guoping
    Dong, Li
    Fang, Liang
    Zhou, Jinchuan
    [J]. APPLICATIONS OF MATHEMATICS, 2013, 58 (02) : 223 - 247
  • [42] A new smoothing and regularization Newton method for the symmetric cone complementarity problem
    Liu, Ruijuan
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 79 - 97
  • [43] A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
    Zhang, XZ
    Ma, FM
    Wang, YJ
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2005, 169 (01) : 388 - 401
  • [44] A Smoothing SAA Method for a Stochastic Linear Complementarity Problem
    Zhang Jie
    Zhang Hong-wei
    Zhang Li-wei
    Yin jing-xue
    [J]. Communications in Mathematical Research, 2013, 29 (02) : 97 - 107
  • [45] The Square-Newton iteration for linear complementarity problem
    Feng, Mei
    Wang, Xiang
    Wang, Teng
    [J]. FILOMAT, 2023, 37 (02) : 467 - 476
  • [46] An Entropy Interval Newton Method for Linear Complementarity Problem
    Wu, Yanqiang
    Xu, Haiwen
    [J]. INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 140 - +
  • [47] Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for P∗(κ)-Weighted Linear Complementarity Problem
    Chi, Xiaoni
    Wang, Guoqiang
    Lesaja, Goran
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2024, 202 (01) : 108 - 132
  • [48] SMOOTHING NEWTON METHODS FOR SYMMETRIC CONE LINEAR COMPLEMENTARITY PROBLEM WITH THE CARTESIAN P/P0-PROPERTY
    Liu, Li-Xia
    Liu, San-Yang
    Wang, Chun-Feng
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2011, 7 (01) : 53 - 66
  • [49] A Modified Smoothing Newton Method for Solving Weighted Complementarity Problems with a Nonmonotone Line Search
    Liu, Xiangjing
    Zhang, Jianke
    Chen, Junfeng
    [J]. ENGINEERING LETTERS, 2023, 31 (04) : 1684 - 1690
  • [50] On the modulus algorithm for the linear complementarity problem
    Schäfer, U
    [J]. OPERATIONS RESEARCH LETTERS, 2004, 32 (04) : 350 - 354