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(nlo 1ε) for the large-step method which coincide with the currently bestý ýknown iteration bounds for CQSCPs.