欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
利用核函数及其性质，对P＊（K）阵线性互补问题提出了一种新的宽邻域不可行内点算法．对核函数作了一些适当的改进，所以是不同于Peng等人介绍的自正则障碍函数．最后证明了算法具有近似0（（1＋2k）n3/4；lognμo/ε）多项武复杂性，是优于传统的基于对数障碍函数求解宽邻域内点算法的复杂性．
英文摘要：
In this paper, we propose a new large-update interior-point algorithm for P＊（k） linear complementarity problems based on kernel functions .We improve some mild conditions on the kernel functions and give a new class of kernel functions .so it is different from the selfregular, functions introduced by Peng. Finally, we show that the complexity of the algorithm 3 has so far worst case O（（1 ＋ 2k）n3/4 lognμo/ε）,which is better than the classical large-update algorithm based on the classical logarithmic barrier functions.
同期刊论文项目
同项目期刊论文
Evolution of Cooperation in Continuous Prisoner';s Dilemma Games on Barabasi-Albert Networks with De
A fuzzy multi-objective model for provider selection in data communication services with different Q
Learning algorithm and the cooperation behavior of continuous prisoner's dilemma game on complex net
期刊信息
位置：