Hi,

I’m trying to code the Euclidean Distance Matrix completion problem. I have tried the following code and although CVX solves it, the solution is not correct.

```
cvx_begin sdp
variable G(n,n) symmetric nonnegative;
minimize( 0.5 * square_pos( norm( H.*( (diag(G)) * ones(n,1)' + ones(n,1) * (diag(G))' - 2*G ) - H.*D, 'fro' ) ) )
subject to
G >= 0;
cvx_end
```