On a special class of regularized central paths for semidefinite programs (Q847845): Difference between revisions

The paper deals with a generalized linear programming problem, where both constraint coefficients and decision variables form symmetrical matrices and the obligatory constraints allow only such solutions, which form a semidefinite matrix. A dual problem is defined for the above mentioned primal one and a central path concept is introduced here as a solution tool. The author has studied existence and convergence of these paths. He has performed an analysis of these paths and the boundary point and presented his own analysis of the high-order local path-following algorithm based on the results of the analysis.