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

zbMATH Open1234.90011MaRDI QIDQ648491FDOQ648491

Authors: Juan-Miguel Gracia 

Publication date: 22 November 2011

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

Recommendations

• New complexity analysis of a full Nesterov-Todd step interior-point method for semidefinite optimization
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• A full NT-step infeasible interior-point algorithm for semidefinite optimization
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step

zbMATH Keywords

polynomial complexityinfeasible interior-point methodprimal-dual method

Mathematics Subject Classification ID

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

Cited In (4)

• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• Full-Newton step infeasible interior-point algorithm for SDO problems
• New complexity analysis of a full Nesterov-Todd step interior-point method for semidefinite optimization
• A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648491)