Resumen de Random projections for the distance geometry problem
Leo Liberti, Benedetto Manca, Pierre Louis Poirion
Random projections decrease the dimensionality of a finite set of vectors while ensuringapproximate congruence, up to a multiplicative constant. Based on the theory of randomprojections in conic programming we derive an application of random projections to anonconvex mathematical programming problem in distance geometry, namely that of findingthe positions of the vertices of a graph in a vector space of given dimension, while ensuring thatevery pair of adjacent vertices is placed at a Euclidean distance equal to the correspondingedge weight.
