TY - JOUR ID - 897 TI - Global convergence of an inexact interior-point method for convex quadratic‎ ‎symmetric cone programming‎ JO - Bulletin of the Iranian Mathematical Society JA - BIMS LA - en SN - 1017-060X AU - Pirhaji, M. AU - Mansouri, H. AU - Zangiabadi, M. AD - Department of Applied Mathematics‎, ‎Faculty of‎ ‎Mathematical Sciences‎, ‎Shahrekord University‎, ‎P.O‎. ‎Box 115‎, ‎Shahrekord‎, ‎Iran. AD - Department of Applied Mathematics‎, ‎Faculty of ‎Mathematical Sciences‎, ‎Shahrekord University‎, ‎P.O‎. ‎Box 115‎, ‎Shahrekord‎, ‎Iran. Y1 - 2016 PY - 2016 VL - 42 IS - 6 SP - 1363 EP - 1385 KW - Convex quadratic symmetric cone programming‎ KW - ‎short‎ ‎and large step feasible‎ KW - ‎inexact search directions‎ KW - ‎polynomial complexity‎ DO - N2 - ‎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(\sqrt{n}\log\frac{1}{\varepsilon})$‎, ‎and‎ ‎$O(n\log\frac{1}{\varepsilon})$ for the large-step method which coincide with the currently best‎ ‎known iteration bounds for CQSCPs. UR - http://bims.iranjournals.ir/article_897.html L1 - http://bims.iranjournals.ir/article_897_bc55eece1cb0cab824b2d11aa4f3e3ec.pdf ER -