“…During the last decade, different solutions have been proposed for the positioning problem for both cooperative and non-cooperative networks, such as the maximum likelihood estimator (ML) [2,8], the maximum a posteriori estimator [9], multidimensional scaling [10], non-linear least squares (NLS) [11,12], linear least squares approaches [13][14][15], and convex relaxation techniques, e.g., semidefinite programming [12,16] and second-order cone programming [17]. In the positioning literature, complexity, accuracy, and robustness are three important factors that are generally used to evaluate the performance of a positioning algorithm.…”