1 |
J. Peng, C. Roos, and T. Terlaky Self-regular functions and new search directions for linear and semidefinite optimization, Math. Program. 93 (2002), no. 1, Ser. A, 129–171.
DOI
|
2 |
C. Roos, T. Terlaky, and J. Ph. Vial, Theory and Algorithms for Linear Optimization, An interior point approach. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Ltd., Chichester, 1997.
|
3 |
U. Schafer, A linear complementarity problem with a P-matrix, SIAM Rev. 46 (2004), no. 2, 189–201.
|
4 |
S. J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
|
5 |
Y. Q. Bai, M. El Ghami, and C. Roos, A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization, SIAM J. Optim. 15 (2004), no. 1, 101–128.
DOI
ScienceOn
|
6 |
Y. Q. Bai, J. Guo, and C. Roos, A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, Acta Math. Sin. (Engl. Ser.) 25 (2009), no. 12, 2169–2178.
|
7 |
G. M. Cho, M. K. Kim, and Y. H. Lee, Complexity of large-update interior point algorithm for linear complementarity problems, Comput. Math. Appl. 53 (2007), no. 6, 948–960.
DOI
ScienceOn
|
8 |
T. Illes and M. Nagy, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, European J. Oper. Res. 181 (2007), no. 3, 1097–1111.
|
9 |
M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, 538. Springer-Verlag, Berlin, 1991.
|
10 |
M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interior point algorithm for linear programming, Progress in mathematical programming (Pacific Grove, CA, 1987), 29–47, Springer, New York, 1989.
|
11 |
M. Kojima, S. Mizuno, and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming 44 (1989), no. 1, (Ser. A), 1–26.
DOI
|
12 |
M. Kojima, S. Mizuno, and A. Yoshise, An O() iteration potential reduction algorithm for linear complementarity problems, Math. Programming 50 (1991), no. 3, (Ser. A), 331–342.
DOI
|
13 |
J. Peng, C. Roos, and T. Terlaky, A new and efficient large-update interior-point method for linear optimization, Vychisl. Tekhnol. 6 (2001), no. 4, 61–80.
|
14 |
N. Megiddo, Pathways to the optimal set in linear programming, Progress in mathematical programming (Pacific Grove, CA, 1987), 131–158, Springer, New York, 1989.
|
15 |
J. Miao, A quadratically convergent O(( + 1) )-iteration algorithm for the - matrix linear complementarity problem, Math. Programming 69 (1995), no. 3, Ser. A, 355–368.
DOI
|