Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the c...Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the central path,and its polynomial-time complexity bound is given.Finally,two numerical experiments are provided to show the effectiveness of the proposed algorithms.展开更多
基金Foundation item： the Natural Science Foundation of Education Department of Hebei Province （No. D200613009）.
文摘Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the central path,and its polynomial-time complexity bound is given.Finally,two numerical experiments are provided to show the effectiveness of the proposed algorithms.
