欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
本文研究了线性互补问题内点算法.利用全牛顿步长求解迭代方向,获得了算法迭代复杂性为O（nlogn/ε）,推广了Roos等关于线性规划问题不可行内点算法,其复杂性与目前最好的不可行内点算法复杂性一致.
英文摘要：
This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem, which is an extension of Roos＇ results on linear optimization. At last, we prove that the algorithm has O（n log n/ε） polynomial complexity, which coincides with the best known one for the infeasible interior-point Mgorithm at present.
同期刊论文项目
同项目期刊论文
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
期刊信息
位置：