University of MaraghehSahand Communications in Mathematical Analysis2322-580714120190401A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs1271463448310.22130/scma.2018.67206.260ENAliNakhaei AmroudiDepartment of Mathematics and Statistics, Imam Hossein Comprehensive University, Tehran, Iran.Ali RezaShojaeifardDepartment of Mathematics and Statistics, Imam Hossein Comprehensive University,
Tehran, Iran.MojtabaPirhajiDepartment of Mathematics and Statistics, Imam Hossein Comprehensive University,
Tehran, Iran.Journal Article20170709An 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.https://scma.maragheh.ac.ir/article_34483_318abecd2c5960bbb1dffc0fb04f4297.pdf