@article {
author = {Pirhaji, M. and Mansouri, H. and Zangiabadi, M.},
title = {Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming},
journal = {Bulletin of the Iranian Mathematical Society},
volume = {42},
number = {6},
pages = {1363-1385},
year = {2016},
publisher = {Iranian Mathematical Society (IMS)},
issn = {1017-060X},
eissn = {1735-8515},
doi = {},
abstract = {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.},
keywords = {Convex quadratic symmetric cone programming,short and large step feasible,inexact search directions,polynomial complexity},
url = {http://bims.iranjournals.ir/article_897.html},
eprint = {http://bims.iranjournals.ir/article_897_bc55eece1cb0cab824b2d11aa4f3e3ec.pdf}
}