| 求解退化单调线性互补问题极大互补解的复杂性 |
| |
| 引用本文： | 黄正海 钱道翠. 求解退化单调线性互补问题极大互补解的复杂性[J]. 应用数学, 1999, 12(2): 115-120 |
| |
| 作者姓名： | 黄正海 钱道翠 |
| |
| 作者单位： | 复旦大学统计运筹系!上海,200437,浙江经济专科学校!嘉兴,314003 |
| |
| 基金项目： | 国家自然科学基金!19871016 |
| |
| 摘 要： | 本文考虑求解退化单调线性互补问题的一类不可行内点算法,其中嵌入一个恢复算法,给出了用这类算法产生所考虑问题的一个精确极大互补解的复杂性．
|
| 关 键 词： | 内点算法 退化单调线性互补问题 复杂性 |
The Comlexity for Finding a Maximally Conplementary Solution to the Degenerate Monotone LCP |
| |
| Huang Zhenghai. The Comlexity for Finding a Maximally Conplementary Solution to the Degenerate Monotone LCP[J]. Mathematica Applicata, 1999, 12(2): 115-120 |
| |
| Authors: | Huang Zhenghai |
| |
| Abstract: | In this paper,we consider a class of infeasible interior point algorithms for solving the degenerate monotone linear complementarity problem,where a rounding procedure is embed-ed. We give out the complexity of the algorithm above which yields an exact maximally com-plementary solution to the problem concerned |
| |
| Keywords: | Interior point algorithm degenerate monotone LCP complexity .Maximally complementary solution |
| 本文献已被 CNKI 维普 等数据库收录！ |
