A self-adjusting interior point algorithm for linear complementarity problems

被引：4
|
作者：
He, SY [1 ]
Li, XS
Pan, SH
机构：
[1] Dalian Univ Foreign Languages, Ctr Comp, Dalian 116002, Peoples R China
[2] Dalian Univ Technol, Dept Mech Engn, State Key Lab Struct Anal Ind Equipment, Dalian 116024, Peoples R China
[3] S China Univ Technol, Dept Appl Math, Guangzhou 510641, Peoples R China
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2005年 / 50卷 / 1-2期
关键词：
linear complementarity problems; central path; proximity measure; interior point algorithm; self-adjusting;
D O I：
10.1016/j.camwa.2005.03.002
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Based on the min-max principle, the standard centering equation in the interior point method is replaced by the optimality condition of a new proximity measure function. Thus, a self-adjusting mechanism is constructed in the new perturbed system. The Newton direction can be adjusted self-adaptively according to the information of last iterates. A self-adjusting interior point method is given based on the new perturbed system. Numerical comparison is made between this algorithm and a primal-dual interior point algorithm using "standard" perturbed system. Results demonstrate the efficiency and some advantages of the proposed algorithm. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：33 / 40
页数：8
相关论文
共 50 条
  • [21] Complexity of large-update interior point algorithm for P*(κ) linear complementarity problems
    Cho, G. M.
    Kim, M. K.
    Lee, Y. H.
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2007, 53 (06) : 948 - 960
  • [22] Path-following interior-point algorithm for monotone linear complementarity problems
    Grimes, Welid
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2022, 15 (09)
  • [23] Interior Point Method for Solving the Horizontal Linear Complementarity Problems
    Jiang, Xingwu
    Wang, Xiuyu
    Yang, Taishan
    Liu, Qinghuai
    PROCEEDINGS OF THE 2011 INTERNATIONAL CONFERENCE ON INFORMATICS, CYBERNETICS, AND COMPUTER ENGINEERING (ICCE2011), VOL 3: COMPUTER NETWORKS AND ELECTRONIC ENGINEERING, 2011, 112 : 499 - +
  • [24] An infeasible-interior-point method for linear complementarity problems
    Simantiraki, EM
    Shanno, DF
    SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (03) : 620 - 640
  • [25] A feasible interior point algorithm for monotone linear complementarity problem
    Yong, Longquan
    ADVANCING SCIENCE THROUGH COMPUTATION, 2008, : 48 - 51
  • [26] A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS
    马昌凤
    梁国平
    陈新美
    Applied Mathematics and Mechanics(English Edition), 2003, (03) : 355 - 362
  • [27] A positive interior-point algorithm for nonlinear complementarity problems
    Ma, CF
    Liang, GP
    Chen, XM
    APPLIED MATHEMATICS AND MECHANICS-ENGLISH EDITION, 2003, 24 (03) : 355 - 362
  • [28] A positive interior-point algorithm for nonlinear complementarity problems
    Ma Chang-feng
    Liang Guo-ping
    Chen Xin-mei
    Applied Mathematics and Mechanics, 2003, 24 (3) : 355 - 362
  • [29] On complexity of a new Mehrotra-type interior point algorithm for P() linear complementarity problems
    Zhou, Yiyuan
    Zhang, Mingwang
    Huang, Zhengwei
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2019,
  • [30] A New Ai-Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems
    E-Nagy, Marianna
    Varga, Anita
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2024, 202 (01) : 76 - 107
12345