یک روش نقطه درونی نشدنی با گام کامل نیوتن اصلاح شده برای مساله مکملی خطی یکنوا

[1] Cottle, R. W., Pang, J. S. and Stone, R. E. The Linear Complementarity Problem,

Academic Press, San Diego, CA. 1992.

[2] Dantzig, G. Linear Programming and Extensions, Princeton University Press,

Princeton, N.J. , 1963.

[3] Karmarkar, N. New polynomial-time algorithm for linear programming,

Combinattorica, 4, (1984) 373-395.

[4] Khachiyan, L.G., A polynomial algorithm in linear programming, Dokl. Akad. Nauk

SSSR, 244(5), (1979) 1093-1096.

[5] Kheirfam, B. A full-Newton step infeasible interior-point algorithm for linear

complementarity problems based on a kernel function, Algorithmic Operations

Research , 7, (2013) 103-110.

[6] Kheirfam, B. and Mahdavi-Amiri, N. A full Nesterov-Todd step infeasible interiorpoint

algorithm for symmetric cone linear complementarity problem, Bulletin of

Iranian Mathematical Society, 40(3), (2014) 541-564.

[7] Kheirfam, B. A new complexity analysis for full-Newton step infeasible interiorpoint

algorithm for ( ) * P  -horizontal linear complementarity problems, Journal of

Optimization Theory and Applications, 161(3), (2014) 853-869.

[8] Kheirfam, B. A new infeasible interior-point method based on Darvay’s technique

for symmetric optimization, Annals of Operations Research, 211(1), (2013) 209-224.

[9] Kheirfam, B. A full step infeasible interior-point method for Cartesian

P ( )  SCLCP *  , Optimization Letters, 10(3), (2016) 591-603.

[10] Kheirfam, B. An improved full-Newton step O(n) infeasible interior-point method

for horizontal linear complementarity problem, Numerical Algorithms, 71(3), (2016)

491-503.

[11] Kojima, M., Megiddo, N. and Noma, T. A Unified Approach To Interior Point

Algorithms For Linear Complementarity Problems, Lecture Notes in Computer and

Science, Springer, 538, 1991.

[12] Kojima, M., Megiddo, N. and Mizuno, S. A primal-dual infeasible-interiorpoint

algorithm for linear programming, Mathematical Programming, 61, (1993) 263-280.

[13] Klee, V., Minty, J., How good is the simplex algorithm? In Inequalities, III (Proc.

Third Sympos., Univ. California, Los Angeles, calif., 1969; dedicated to the memory of

Theodore S. Motzkin), pp. 159-175. Academic Press, New York, 1972.

[14] Mizuno, S. Polynomiality of the Kojima-Megiddo-Mizuno infeasible interior point

algorithm for linear programming, Mathematical Programming, 67(1), (1994) 109-120.

[15] Potra, F.A. An O(nL) infeasible-interior-point algorithm for LCP with quadratic

convergence, Annals of Operations Research, 62, (1996) 81-102.

[16] Roos, C. A full-Newton step O(nL) infeasible interior-point algorithm for linear

optimization, SIAM Journal on Optimization, 16(4), (2006) 1110-1136.

[17] Roos, C., Terlaky, T. and Vial, J.-Ph. Theory and Algorithms for Linear

Optimization: An Interior-Point Approach, John Wiley and Sons, Chichester, UK, 1997,

2nd Ed., Springer, 2006.

[18] Roos, C. An improved and simplified full-Newton step O(n) infeasible interiorpoint

method for linear optimization, SIAM Journal on Optimization, 265(1), (2015)

102-114.

[19] Zhang, L., Bai, Y. and Xu, Y. A full-Newton step infeasible interior-point

algorithm for monotone LCP based on a locally-kernel function, Numerical

Algorithms, 61(1), (2012) 57-81.

[20] Zhang, L. and Xu, Y. A full-Newton step interior-point algorithm based on

modified Newton direction, Operations Research Letters, 39, (2011) 318-322.