research preprint

In addition, viewing the problem as an EDM completion problem yields better low rank approximations for the low dimensional realizations.

And, the projection/reduction procedure can be repeated for other given cliques of sensors or for sets of sensors, where many distances are known. Thus, further size reduction can be obtained.

Optimality/duality conditions and a primal-dual interior-exterior path following algorithm are derived for the SDP relaxations We discuss the relative stability and strength of two formulations and the corresponding algorithms that are used. In particular, we show that the quadratic formulation arising from the SDP relaxation is better conditioned than the linearized form, that is used in the literature and that arises from applying a Schur complement.