A predictor-corrector method for solving the P*(k)-matrix lcp from infeasible starting points-Reference-Cited by-同舟云学术

A predictor-corrector method for solving the P*(k)-matrix lcp from infeasible starting points

Published:1995-01 Issue:2 Volume:6 Page:109-126
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Ji Jun,Potra Florian A.,Sheng Rongqin

Publisher

Informa UK Limited

Subject

Applied Mathematics,Control and Optimization,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/10556789508805628

Reference13 articles.

1. On approximate solutions of systems of linear inequalities

2. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

3. Miao, J. 1993.A quadratically convergent-itemtion algorithm for the p*(k)-matrix linear complementarity problem, New Brunswick, USA: Rutgers University. Research Report RRR 93, RUTCOR-Rutgers Center for Operations Research P.O Box 5063

4. Polynomiality of infeasible-interior-point algorithms for linear programming

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP;SIAM Journal on Optimization;2010-01

2. Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization;Journal of Optimization Theory and Applications;2009-11-04

3. Path-following interior point algorithms for the Cartesian P *(κ)-LCP over symmetric cones;Science in China Series A: Mathematics;2009-08

4. A Mizuno–Todd–Ye type predictor–corrector algorithm for sufficient linear complementarity problems;European Journal of Operational Research;2007-09

5. A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems;SIAM Journal on Optimization;2000-01