Find lower dimensional embedding such that the square distances in the embedding are as close as possible to the distances derived from a dissimilarity matrix.
http://users.stat.umn.edu/~gary/classes/5401/handouts/34.mds.handout.pdf
Can solve by finding Eigenvectors of distance matrix. In case dissimilarity matrix is Euclidean distance, this is the same as Principal component analysis