Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483): Difference between revisions

The authors study the invertibility of the matrix that determines the solvability of the Newton equations in smoothing-type algorithms used in optimization problems. They begin with an introduction to this problem and the necessary definitions, which is followed by a section presenting the necessary and sufficient conditions for this matrix to be invertible. In the third section these results are interpreted to the to solvability of the original Newton equations which are used to parameterize the optimization problem.