A Kernel Function Based Interior-Point Methods for Solving P_*(κ)-Linear Complementarity Problem

查看全文 作　　者：M.Reza [1,2]PEYGHAMI;Keyvan [3]AMINI

机构地区：[1]Department of Mathematics, K. N. Toosi University. of Technology;[2]School of Mathematics, Institute for Research in Fundamental Sciences (IPM);[3]Department of Mathematics, Faculty of Sciences, Razi University

出　　处：《Acta Mathematica Sinica,English Series》索引2010年第26卷第9期,共18页

基　　金：Supported by a grant from IPM (Grant No. 8890027) 摘　　要：In this paper, motivated by the complexity results of Interior Point Methods (IPMs) forLinear Optimization (LO) based on kernel functions, we present a polynomial time IPM for solvingP_*(κ)-linear complementarity problem, using a new class of kernel functions. The special case of ournew class was considered earlier for LO by Y. Q. Bai et al. in 2004. Using some appealing propertiesof the new class, we show that the iteration bound for IPMs matches the so far best known theoreticaliteration bound for both large and small updates by choosing special values for the parameters of thenew class. 关键词：非线性互补问题核函数内点方法求解多项式时间线性优化综合防治 IPM

相关文献

参考文献（21）
引证文献（2）
耦合文献（6）

参考文献(21)

引证文献(2)

耦合文献(6)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

A Kernel Function Based Interior-Point Methods for Solving P_*(κ)-Linear Complementarity Problem

参考文献(21)

引证文献(2)

耦合文献(6)

用户提示