Total Least Squares (tls) is usually solved using Singular Value Decomposition. Here we try to solve TLS explicitly as a non-convex NLP problem. This model turns out to be incredibly difficult.
See: https://yetanothermathprogrammingconsultant.blogspot.com/2021/06/total-least-squares-nonconvex.html