Global convergence of an inexact interior-point method for convex quadratic‎ ‎symmetric cone programming‎

In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programming (CQSCP)‎. ‎We also prove that the iteration‎ ‎bound for the feasible short-step method is‎ ‎O(n−−√log1ε)‎, ‎and‎ ‎O(nlog1ε) for the large-step method which coincide with the currently best‎ ‎known iteration bounds for CQSCPs.