TY - JOUR
ID - 34483
TI - A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
JO - Sahand Communications in Mathematical Analysis
JA - SCMA
LA - en
SN - 2322-5807
AU - Nakhaei Amroudi, Ali
AU - Shojaeifard, Ali Reza
AU - Pirhaji, Mojtaba
AD - Department of Mathematics and Statistics, Imam Hossein Comprehensive University, Tehran, Iran.
AD - Department of Mathematics and Statistics, Imam Hossein Comprehensive University,
Tehran, Iran.
Y1 - 2019
PY - 2019
VL - 14
IS - 1
SP - 127
EP - 146
KW - Mixed linear complementarity problem
KW - Symmetric cone
KW - Interior-point methods
KW - Polynomial complexity
DO - 10.22130/scma.2018.67206.260
N2 - 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.
UR - https://scma.maragheh.ac.ir/article_34483.html
L1 - https://scma.maragheh.ac.ir/article_34483_318abecd2c5960bbb1dffc0fb04f4297.pdf
ER -