New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization

zbMath1234.90011MaRDI QIDQ648491

Juan-Miguel Gracia

Publication date: 22 November 2011

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

primal-dual methodpolynomial complexityinfeasible interior-point method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (1)

Unnamed Item

This page was built for publication: New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization