Abstract
In this paper we present an infeasible-interior-point algorithm, based on a new wide neighbourhood N(τ1, τ2, η), for linear programming over symmetric cones. We treat the classical Newton direction as the sum of two other directions. We prove that if these two directions are equipped with different and appropriate step sizes, then the new algorithm has a polynomial convergence for the commutative class of search directions. In particular, the complexity bound is O(r1.5logε−1) for the Nesterov-Todd (NT) direction, and O(r2logε−1) for the xs and sx directions, where r is the rank of the associated Euclidean Jordan algebra and ε > 0 is the required precision. If starting with a feasible point (x0, y0, s0) in N(τ1, τ2, η), the complexity bound is \(O\left( {\sqrt r \log {\varepsilon ^{ - 1}}} \right)\) for the NT direction, and O(rlogε−1) for the xs and sx directions. When the NT search direction is used, we get the best complexity bound of wide neighborhood interior-point algorithm for linear programming over symmetric cones.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ai, W. Neighborhood-following algorithms for linear programming. Sci. China Ser. A., 47: 812–820 (2004)
Ai, W., Zhang, S. An \(O\left( {\sqrt n L} \right)\) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim., 16: 400–417 (2005)
Alizadeh, F., Xia, Y. The Q method for symmetric cone programming. J. Optim. Theory Appl., 149: 102–137 (2011)
Faraut, J., Korányi, A. Analysis on Symmetric Cones. Oxford University Press, New York, 1994
Faybusovich, L. Euclidean Jordan algebras and interior-point algorithms. Positivity, 1: 331–357 (1997)
Faybusovich, L. Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Compu. Appl. Math., 86: 149–175 (1997)
Gu, G., Zangiabadi, M., Roos, C. Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res., 214: 473–484 (2011)
Güler, O. Barrier functions in interior-point methods. Math. Oper. Res., 21: 860–885 (1996)
Li, Y., Terlaky, T. A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O\left( {\sqrt n \log \frac{{Tr\left( {{X^0}{S^0}} \right)}}{\varepsilon }} \right)\) iteration complexity. SIAM J. Optim., 20: 2853–2875 (2010)
Liu, C., Liu, H., Shang, Y. Neighborhood-following algorithms for symmetric cone programming. Sci. Sin. Math., 43: 691–702 (2013) (in Chinese)
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(3): 796–815 (2013)
Monteiro, R.D.C., Zhang, Y. A unified analysis for a class of long-step primal-dual path-following interiorpoint algorithms for semidefinie programming. Math. Program., 81: 281–299 (1998)
Nesterov, Yu., Nemirovski, A. Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994
Nesterov, Yu., Todd, M.J. Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res., 22: 1–42 (1997)
Nesterov, Yu., Todd, M.J. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim., 8: 324–364 (1998)
Potra, F.A. An infeasible interior point method for linear complementarity problems over symmetric cones. AIP Conf. Proc., 1168: 1403–1406 (2009)
Rangarajan, B.K. Polynomial convergence of infeasible-interior-pointmethods over symmetric cones. SIAM J. Optim., 16: 1211–1229 (2006)
Schmieta, S.H., Alizadeh, F. Extension of primal-dual interior-point algorithm to symmetric cones. Math. Program., 96: 409–438 (2003)
Wang, G.Q., Bai, Y.Q. A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization. J. Optim. Theory Appl., 154: 966–985 (2012)
Zhang, J., Zhang, K. Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming. Math. Methods Oper., Res., 73: 75–90 (2011)
Acknowledgements
The authors are grateful to the anonymous referees and editors for their constructive and valuable suggestions improving this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 11471102) and the Key Basic Research Foundation of the Higher Education Institutions of Henan Province (No. 16A110012).
Rights and permissions
About this article
Cite this article
Liu, Ch., Shang, Yl. & Han, P. A new infeasible-interior-point algorithm for linear programming over symmetric cones. Acta Math. Appl. Sin. Engl. Ser. 33, 771–788 (2017). https://doi.org/10.1007/s10255-017-0697-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-017-0697-7