摘要
为求解笛卡尔P*(κ)对称锥非线性互补问题,采用无穷范数宽邻域,研究了宽邻域不可行内点算法的理论复杂度,发现其与Frobenius范数宽邻域的复杂度一致.数值实验结果表明,该算法有效且稳定.
In order to solve Cartesian P*(κ)symmetric cone nonlinear complementarity problems,the theoretical complexity of the wide neighborhood infeasible interior-point algorithm is studied with the infinite norm wide neighborhood.It is found that the complexity is consistent with that of Frobenius norm wide neighborhood.The data results show that the algorithm is effective and stable.
作者
赵花丽
ZHAO Huali(School of Mathematics and Statistics,Xianyang Normal University,Xianyang 712000,China)
出处
《杭州师范大学学报（自然科学版）》
CAS
2022年第1期94-100,共7页
Journal of Hangzhou Normal University(Natural Science Edition)
基金
陕西省教育厅科学研究计划项目(19JK0929)
咸阳师范学院科研基金项目(XSYK17015).
关键词
非线性互补问题
内点算法
不可行
宽邻域
nonlinear complementarity problems
interior-point algorithm
infeasible
wide neighborhood
