会议专题

Plynomial convergence of primal-dual algorithms for SDLCP based on the Monteiro-Zhang family of directions

  The paper establishes the polynomial converge-nce of a new class of path-following methods for semide-finite linear complementarity problems (SDLCP) whos-se search directions belong to the class of directions introduced by Monteiro 7.Namely,we show that the polynomial iteration complexity bounds of the well known algori-thm for linear programming,namely the short-step path-following algorithm of Kojima et al.and Monteiro and Alder,carry over to the context of SDLCP

interior-point algorithm path-following method semidefinite linear complementarity problems

Guangzhou Li

School of Physical Education, Chongqing Three Gorges University, Chongqing, China

国际会议

2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

西安

英文

1857-1860

2012-08-24(万方平台首次上网日期,不代表论文的发表时间)