|
Abstract
|
In this paper, we design a primal-dual infeasible interior-point
method for circular optimization that uses only full Nesterov-Todd steps. Each
main iteration of the algorithm consisted of one so-called feasibility step. Fur-
thermore, giving a complexity analysis of the algorithm, we derive the currently
best-known iteration bound for infeasible interior-point methods.
|