Eigenvalue multiplicity estimate in semidefinite programming

Proposes a non-heuristic scheme to estimate the eigenvalue multiplicity at solution in semidefinite programming. With some mild assumptions, it is shown that there exists an open neighborhood around the solution so that the authors´ scheme applied to any point in this neighborhood will always give the correct eigenvalue multiplicity at solution. The authors also show how to incorporate this result into a generalization of an existing local method for solving the semidefinite programming problem