Abstract
In this paper we propose a new predictor-corrector algorithm with superlinear convergence in a wide neighborhood for linear programming problems. We let the centering parameter in a predictor step is chosen adaptively, which is different from other algorithms in the same wide neighborhood. The choice is a key for the local convergence of the new algorithm. In addition, we use the classical affine scaling direction as a part in a corrector step, not in a predictor step, which contributes to the complexity result. We prove that the new algorithm has a polynomial complexity of \(O(\sqrt{n}L)\), and the duality gap sequence is superlinearly convergent to zero, under the assumption that the iterate points sequence is convergent. Finally, numerical tests indicate its effectiveness.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wright, S.J.: Primal-dual interior-point methods. SIAM, Philadephia (1997)
Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1997)
Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Math. 24, 281–302 (2000)
Güler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Progr. 60, 215–228 (1993)
Zhang, Y., Tapia, R.A., Dennis, J.E.: On the Superlinear and quadratic convergence of primal-dual interior-point linear programming algorithms. SIAM J. Optim. 2, 304–323 (1992)
Zhang, Y., Tapia, R.A.: Superlinear and quadratic convergence of primal-dual interior point algorithms for linear programming revisited. J. Optim. Theory Appl. 73, 229–242 (1992)
Zhang, Y., Tapia, R.A.: A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming. SIAM J. Optim. 3, 118–133 (1993)
Mizuno, S., Todd, M.J., Ye, Y.: On adaptive step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964–981 (1993)
Ye, Y., Güler, O., Tapia, R.A., Zhang, Y.: A quadratically convergent \(O(\sqrt{n}L)\)-iteration algorithm for linear programming. Math. Progr. 59, 151–162 (1993)
Roos, C., Peng, J., Terlaky, T.: Self-Regularity: A New Paradigm for Primal–Dual Interior-Point Algorithms. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2002)
Ai, W., Zhang, S.: An \(O(\sqrt{n}L)\) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16, 400–417 (2005)
Liu, C., Liu, H., Cong, W.: An \(O(\sqrt{n}L)\) iteration primal-dual second-order corrector algorithm for linear programming. Optim. Lett. 5(4), 729–743 (2011)
Liu, C., Liu, H., Liu, X.: Polynomial convergence of second-order Mehrotra-type predictor-corrector algorithms over symmetric cones. J. Optim. Theory Appl. 154, 949–965 (2012)
Liu, H., Liu, X., Liu, C.: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem. Appl. Numer. Math. 62, 1685–1700 (2012)
Liu, H., Yang, X., Liu, C.: A new wide neighborhood primal-dual infeasible interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158, 796–815 (2013)
Feng, Z., Fang, L.: A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65–76 (2014)
Potra, F.A.: Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24, 1–28 (2014)
Yang, X., Liu, H., Zhang, Y.: A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighborhood for semi-definite programming. Int. J. Comput. Math. 91, 1082–1096 (2014)
Zhang, Y.: Solving large-scale linear programs by interior-point methods under the MATLAB environment. Optim. Methods Softw. 10, 1–31 (1999)
Zhu X., Peng J., Terlaky T. and Zhang G.: On implementing self-regular proximity based feasible IPMs. Technical report 2003-02-01. http://www.cas.mcmaster.ca/oplab/publication (2003)
Cartis, C.: On the convergence of a primal–dual second-0rder corrector interior point algorithm for linear programming. Transpl. Proc. 41(8), 2949–2951 (2005)
Acknowledgments
This work is supported by National Natural Science Foundation of China (11301415, 61303030) and the Special Research Foundation of Education Department of Shaanxi Province (15JK1651).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ma, X., Liu, H. A superlinearly convergent wide-neighborhood predictor–corrector interior-point algorithm for linear programming. J. Appl. Math. Comput. 55, 669–682 (2017). https://doi.org/10.1007/s12190-016-1055-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-016-1055-2