期刊文献+

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P_*(κ) LINEAR COMPLEMENTARITY PROBLEM 被引量:1

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P_*(κ) LINEAR COMPLEMENTARITY PROBLEM
原文传递
导出
摘要 This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.
机构地区 College of Science
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2014年第5期1027-1044,共18页 系统科学与复杂性学报(英文版)
基金 supported by the Natural Science Foundation of Hubei Province under Grant No.2008CDZ047
关键词 Full-Newton steps infeasible interior-point method P*(κ) linear complementarity problems polynomial complexity 不可行内点算法 线性互补问题 牛顿 迭代复杂性 内核函数 Optim 屏障功能 内点方法
  • 相关文献

参考文献1

二级参考文献13

  • 1B. Jansen,C. Roos,T. Terlaky,Y. Ye.Improved complexity using higher-order correctors for primal-dual Dikin affine scaling[J]. Mathematical Programming . 1997 (1)
  • 2Florian A. Potra,Rongqin Sheng.Predictor-corrector algorithm for solvingP *(κ)-matrix LCP from arbitrary positive starting points[J]. Mathematical Programming . 1997 (1)
  • 3Renato D. C. Monteiro,Ilan Adler.Interior path following primal-dual algorithms. part II: Convex quadratic programming[J]. Mathematical Programming . 1989 (1-3)
  • 4Jansen,B.,Roos,C.,Terlaky,T.,Ye,Y.Improved Complexity Using Higher Order Correctors for Primal-Dual Dikin Affine Scaling. Mathematical Programming, Series B . 1997
  • 5M. Kojima,N. Megiddo,T. Noma,A. Yoshise.A?Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. . 1991
  • 6I. Adler,R.D.C. Monteiro.Interior path following primal-dual algorithms. Part?II: Convex quadratic programming. Mathematical Programming . 1989
  • 7Monteiro,R.C.,Adler,I.,Resende,M.C.A plynomial-time primal—dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Mathematics of Operations Research . 1990
  • 8Jansen B,Roos C,Terlaky T.A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming. Mathematics of Operations Research . 1996
  • 9Potra,F.A.,Sheng,R.Predictor-corrector algorithm for solving P*κ-matrix LCP from arbitrary positive starting points. Mathematical Programming . 1997
  • 10Hannu V&#xe4,liaho.Pmatrices are just sufficient. Linear Algebra and Its Applications . 1996

共引文献1

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部