An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood

DOI10.1007/s10440-018-0164-3zbMath1417.90139MaRDI QIDQ1731107

Xianqiang Yang

Publication date: 20 March 2019

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-018-0164-3

zbMATH Keywords

interior point methods; polynomial complexity; wide neighborhood; ellipsoidal approximation; symmetric optimization

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90C51: Interior-point methods