Abstract:
The primal–dual Newton method for solving the linear semidefinite programming problem is considered. Both primal and weak dual variables may be rank-deficient and belong to the boundaries of feasible sets. Formulas for determining the displacement directions are presented, and properties of these directions are investigated. A technique for selecting the displacement steps that leads to decreasing the rank of the symmetrized product of the primal and weak dual variables is described.
