%0 Journal Article %T A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs %J Sahand Communications in Mathematical Analysis %I University of Maragheh %Z 2322-5807 %A Nakhaei Amroudi, Ali %A Shojaeifard, Ali Reza %A Pirhaji, Mojtaba %D 2019 %\ 04/01/2019 %V 14 %N 1 %P 127-146 %! A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs %K Mixed linear complementarity problem %K Symmetric cone %K Interior-point methods %K Polynomial complexity %R 10.22130/scma.2018.67206.260 %X An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point methods. %U https://scma.maragheh.ac.ir/article_34483_318abecd2c5960bbb1dffc0fb04f4297.pdf