References

THE LEAST SQUARES STOCHASTIC SOLUTIONS
OF THE MATRIX EQUATION


[1] F. Bastos and A. Teixeira, An extension of variant of a predictor-corrector primal-dual method from linear programming to semidefinite programming, Investação Operacional 25 (2005), 253-276.

[2] Henri Berthiaux, Vadim Mizonov and Vladimir Zhukov, Application of the theory of Markov chains to model different processes in particle technology, Powder Technology 157 (2005), 128-137.

[3] Coralia Cartis, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Applied Numerical Mathematics 59(5) (2009), 1110-1119.

[4] X. F. Cha, Application of Markov chain to market forecasting, Journal of Jiangsu University (Social Science Edition) 5(1) (2003), 110-113.

[5] Bo Kyung Choi and Gue Myung Lee, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, Nonlinear Analysis: Theory, Methods & Applications 71(12) (2009), 2628-2640.

[6] Richard G. Clegg, A discrete-time Markov-modulated queuing system with batched arrivals, Performance Evaluation 67 (2010), 376-385.

[7] R. L. Feng, D. F. Ou and Z. H. Peng, Analysis of market share: A practical research of Markov theory, Journal of University of Electric Power (Natural Science) 20(4) (2005), 85-88.

[8] Tibor Ills and Marianna Nagy, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, European Journal of Operational Research 181(3) (2007), 1097-1111.

[9] N. M. S. Karmitsa, M. M. Mkel and M. M. Ali, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Applied Mathematics and Computation 198(1) (2008), 382-400.

[10] L. X. Liu, S. Y. Liu and H. W. Liu, A predictor-corrector smoothing Newton method for symmetric cone complementarity problems, Applied Mathematics and Computation 217(7) (2010), 2989-2999.

[11] J. Peng, T. Terlaky and Y. B. Zhao, A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function, SIAM Journal on Optimization 15(4) (2005), 1105-1127.

[12] J. J. F. A. Potra and S. Huang, A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, Journal of Optimization Theory and Applications 84(1) (1995), 187-199.

[13] Florian A. Potra, The Mizuno-Todd-Ye algorithm in a large neighbourhood of the central path, European Journal of Operation Research 143 (2002), 257-267.

[14] Florian A. Potra, A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighbourhood of the central path with -iteration complexity, Mathematical Programming 100(2) (2004), 317-337.

[15] V. Rico-Ramrez and A. W. Westerberg, Interior point methods for the solution of conditional models, Computers & Chemical Engineering 26(3) (2002), 375-383.

[16] Maziar Salahi and Nezam Mahdavi-Amiri, Polynomial time second order Mehrotra-type predictor-corrector algorithms, Applied Mathematics and Computation 183(1) (2006), 646-658.

[17] M. Salahi, J. Peng and T. Terlaky, On Mehrotra-type predictor-corrector algorithms, SIAM Journal on Optimization 18(4) (2007), 1377-1397.

[18] Maziar Salahi, A finite termination Mehrotra-type predictor-corrector algorithm, Applied Mathematics and Computation 190(2) (2007), 1740-1746.