1 |
Zs. Darvay, I.-M. Papp, and P.-R. Takacs, An infeasible full-Newton step algorithm for linear optimization with one centering step in major iteration, Studia Univ. Babes Bolyai Inform. 59 (2014), no. 1 28-45.
|
2 |
G. Gu, M. Zangiabadi, and C. Roos, Full Nesterov-Todd step infeasible interior-point methods for symmetric optimization, European J. Oper. Res. 214 (2011), no. 3, 473-484.
DOI
|
3 |
N. K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), no. 4, 373-395.
DOI
|
4 |
H. Mansouri and C. Roos, A simplified O(nL) infeasible interior-point algorithm for linear optimization using full Newton steps, Optim. Methods Softw. 22 (2007), no. 3, 519-530.
DOI
|
5 |
H. Mansouri and M. Zangiabadi, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, Optimization 62 (2013), no. 2, 285-297.
DOI
|
6 |
H. Mansouri, M. Zangiabadi, and M. Arzani, A modified infeasible-interior-point algorithm for linear optimization problems, J. Optim. Theory Appl. 166 (2015), no. 2, 605-618.
DOI
|
7 |
H. Mansouri, M. Zangiabadi, and M. Pirhaji, A full-Newton step O(n) infeasible interior-point algorithm for linear complementarity problems, Nonlinear Anal. Real World Appl. 12 (2011), no. 1, 545-561.
DOI
|
8 |
C. Roos, A full-Newton step O(n) infeasible interior-point algorithm for linear optimization, SIAM J. Optim. 16 (2006), no. 4, 1110-1136.
DOI
|
9 |
C. Roos, An improved and simplified full-Newton step O(n) infeasible interior-point method for linear optimization, SIAM J. Optim. 25 (2015), no. 1, 102-114.
DOI
|
10 |
Gy. Sonnevend, An Analytic Center for Polyhedrons and New Classes of Global Algorithms for Linear (Smooth, Convex) Programming, Lecture Notes in Control and Information Sciences, 84, pp. 866-876, Springer, Berlin, 1985.
|
11 |
G. Q. Wang and Y. Q. Bai, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, J. Optim. Theory Appl. 154 (2012), no. 3, 966-985.
DOI
|
12 |
G. Q. Wang, Y. Q. Bai, X. Y. Gao and D. Z. Wang, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, J. Optim. Theory Appl. 165 (2014), no. 1, 242-262.
DOI
|
13 |
G. Q. Wang and G. Lesaja, Full Nesterov-Todd step feasible interior-point method for the Cartesian -SCLCP, Optim. Methods Softw. 28 (2013), no. 3, 600-618.
DOI
|
14 |
M. Zangiabadi, S. Asadi, and H. Mansouri, Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimization, Int. J. Oper. Res., in press.
|
15 |
L. Zhang and Y. Xu, A full-Newton step interior-point algorithm based on modi ed Newton direction, Oper. Res. Lett. 39 (2011), no. 5, 318-322.
DOI
|