Affordable Access

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

Authors
Publisher
ANZIAM Journal
Publication Date
Keywords
  • Semidefinite Optimization
  • Infeasible Interior-Point Method
  • Polynomial Complexity
  • Self-Regular
  • Primary 90C51
  • Secondary 90C22
Disciplines
  • Computer Science

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

There are no comments yet on this publication. Be the first to share your thoughts.