A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems

被引:0
|
作者
Soodabeh Asadi
Zsolt Darvay
Goran Lesaja
Nezam Mahdavi-Amiri
Florian Potra
机构
[1] Sharif University of Technology,Faculty of Mathematical Sciences
[2] University of Applied Sciences and Arts Northwestern Switzerland,Institute for Data Science, School of Engineering
[3] Babeş-Bolyai University,Faculty of Mathematics and Computer Science
[4] US Naval Academy,Department of Mathematics
[5] Georgia Southern University,Department of Mathematical Sciences
[6] University of Maryland,Department of Mathematics and Statistics
来源
Journal of Optimization Theory and Applications | 2020年 / 186卷
关键词
Weighted complementarity; Interior-point; Path-following; Full-Newton step; 90C33; 90C51;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, a full-Newton step Interior-Point Method for solving monotone Weighted Linear Complementarity Problem is designed and analyzed. This problem has been introduced recently as a generalization of the Linear Complementarity Problem with modified complementarity equation, where zero on the right-hand side is replaced with the nonnegative weight vector. With a zero weight vector, the problem reduces to a linear complementarity problem. The importance of Weighted Linear Complementarity Problem lies in the fact that it can be used for modelling a large class of problems from science, engineering and economics. Because the algorithm takes only full-Newton steps, the calculation of the step size is avoided. Under a suitable condition, the algorithm has a quadratic rate of convergence to the target point on the central path. The iteration bound for the algorithm coincides with the best iteration bound obtained for these types of problems.
引用
收藏
页码:864 / 878
页数:14
相关论文
共 50 条
  • [1] A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems
    Asadi, Soodabeh
    Darvay, Zsolt
    Lesaja, Goran
    Mahdavi-Amiri, Nezam
    Potra, Florian
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2020, 186 (03) : 864 - 878
  • [2] A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
    Achache, Mohamed
    Tabchouche, Nesrine
    OPTIMIZATION LETTERS, 2019, 13 (05) : 1039 - 1057
  • [3] A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
    Mohamed Achache
    Nesrine Tabchouche
    Optimization Letters, 2019, 13 : 1039 - 1057
  • [4] A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem
    Xiaoni Chi
    Guoqiang Wang
    Journal of Optimization Theory and Applications, 2021, 190 : 108 - 129
  • [5] A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem
    Chi, Xiaoni
    Wang, Guoqiang
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2021, 190 (01) : 108 - 129
  • [6] A New full-newton step infeasible interior-point method for P*(?)-linear Complementarity problem
    Lee, Jong-Kyu
    Cho, You-Young
    Jin, Jin-Hee
    Cho, Gyeong-Mi
    OPTIMIZATION LETTERS, 2024, 18 (04) : 943 - 964
  • [7] Complexity analysis of a full-Newton step interior-point method for linear optimization
    Zsolt Darvay
    Ingrid-Magdolna Papp
    Petra-Renáta Takács
    Periodica Mathematica Hungarica, 2016, 73 : 27 - 42
  • [8] A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems
    Behrouz Kheirfam
    Journal of Optimization Theory and Applications, 2014, 161 : 853 - 869
  • [9] Complexity analysis of a full-Newton step interior-point method for linear optimization
    Darvay, Zsolt
    Papp, Ingrid-Magdolna
    Takacs, Petra-Renata
    PERIODICA MATHEMATICA HUNGARICA, 2016, 73 (01) : 27 - 42
  • [10] AN IMPROVED INFEASIBLE INTERIOR-POINT METHOD WITH FULL-NEWTON STEP FOR LINEAR OPTIMIZATION
    Zhang, Lipu
    Bai, Yanoin
    Xu, Yinghong
    Jin, Zhengjing
    PACIFIC JOURNAL OF OPTIMIZATION, 2014, 10 (03): : 631 - 647