The low-rank approximation problem is to find the closest matrix with given (and low) rank from a given matrix. In some cases both the given matrix and its approximation are submitted to certain constraints. In this talk we study the geometry of this problem and we described a dynamical system associated with.