A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity

Authors

  • B. Kheirfam

DOI:

https://doi.org/10.21914/anziamj.v53i0.4479

Keywords:

semidefinite optimization, infeasible interior-point method, polynomial complexity, self-regular

Abstract

We introduce a full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular function to provide the feasibility step and to measure proximity to the central path. The result of polynomial complexity coincides with the best known iteration bound for infeasible interior-point methods. doi:10.1017/S144618111200003X

Published

2012-05-21

Issue

Vol. 53 (2011)

Section

Articles for Printed Issues