|
|||||
|
|
Interior-point algorithm based on general kernel function for monotone linear complementarity problem |
|
| Authors: | Yong Liu Yan-qin Bai |
| Institution: | Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China |
| Abstract: | A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on:a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP. |
| Keywords: | monotone linear complementarity problem (MLCP) interior-point method kernel function polynomial complex-ity |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |
| 点击此处可从《上海大学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《上海大学学报(英文版)》下载免费的PDF全文 | |