[1] |
Nesterov E, Nemirovskii S. Interior-point Polynomial Algorithm in Convex Programming. Philadelphia:SIAM, 1994
|
[2] |
Faybusovich L. Linear systems in Jordan algebras and primal-dual interior-point algorithms. J Comput Appl Math, 1997, 86:149-175
|
[3] |
Monteiro R D C, Zhang Y. A unified analysis for a class of path following primal-dual interior-point algorithm for semidefinite optimization programming. Math Program, 1988, 81:281-299
|
[4] |
Schmieta S H, Alizadeh F. Extension of primal-dual interior-point algorithms to symmetric cones. Math Program, Ser A, 2003, 96:409-438
|
[5] |
Mehrotra S. On the implemention of a primal-dual interior-point method. SIAM J Optim, 1992, 2:575-601
|
[6] |
Salahi M, Mahdavi-Amiri N. Polynomial time second order Mehrotra-type predictor-corrector algorithms. App Math Comput, 2006, 183:646-658
|
[7] |
Liu C, Liu H, Liu X. Polynomial convergence of second-order Mehrotra-type predictor-corrector algorithms over symmetric cones. J Optim Theory Appl, 2012, 154:949-965
|
[8] |
Mizuno S, Todd M J, Ye Y. On adaptive step primal-dual interior-point algorithms for linear programming. Math Oper Res, 1993, 18:964-981
|
[9] |
Ye Y, Tapia R A, Zhang Y. A superlinearly convergent O(√nL)-iteration algorithm for linear programming. Math Program, 1991, 50:239-258
|
[10] |
Yang X, Zhang Y, Liu H, Pei Y. A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones. Numer Algor, 2016, 72:915-936
|
[11] |
Yang Y. A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur J Oper Res, 2011, 215:25-38
|
[12] |
Yang Y. A polynomial arc-search interior-point algorithm for linear programming. J Optim Theory Appl, 2013, 158:859-873
|
[13] |
Yang Y. Curve LP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming. Numer Algor, 2017, 74:967-996
|
[14] |
Yang X, Zhang Y, Liu H. A wide neighborhood infeasible interior-point method with arc search for linear programming. J Appl Math Comput, 2016, 51:209-225
|
[15] |
Yang X, Liu H, Zhang Y. An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim Lett, 2017, 11:135-152
|
[16] |
Yang Y, Yamashita M. An arc-search O(nL) infeasible-interior-point algorithm for linear programming. Optim Lett, 2018, 12(4):781-798
|
[17] |
Pirhaji M, Mansouri H, Zangiabadi M. An ℓ2-neighborhood infeasible interior-point algorithm for linear complementarity problems. 4OR-Q J Oper Res, 2017, 15(2):111-131
|
[18] |
Faraut J, Koranyi A. Analysis on Symmetric Cones. New York:Oxford University Press, 1994
|
[19] |
Carmo M P. Differential Geometry of Curves and Surfaces. New Jersey:Prentice-Hall, 1976
|
[20] |
Yang X, Liu H, Liu C. A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhiood for symmetric optimization. J Comput Apll, 2015, 283:106-121
|
[21] |
Gu G, Zangiabadi M, Roos C. Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. Eur J Oper Res, 2011, 214:473-484
|
[22] |
Liu H, Yang X, Liu C. A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming. J Optim Theory Appl, 2013, 158:796-815
|
[23] |
Rangarajan B K. Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J Optim, 2006, 16:1211-1229
|