Efficiently solving total least squares with Tikhonov identical regularization.

Yang, Meijia; Xia, Yong; Wang, Jiulin; Peng, Jiming

The Tikhonov identical regularized total least squares (TI) is to deal with the ill-conditioned system of linear equations where the data are contaminated by noise. A standard approach for (TI) is to reformulate it as a problem of finding a zero point of some decreasing concave non-smooth univariate function such that the classical bisection search and Dinkelbach’s method can be applied. In this paper, by exploring the hidden convexity of (TI), we reformulate it as a new problem of finding a zero point of a strictly decreasing, smooth and concave univariate function. This allows us to apply the classical Newton’s method to the reformulated problem, which converges globally to the unique root with an asymptotic quadratic convergence rate. Moreover, in every iteration of Newton’s method, no optimization subproblem such as the extended trust-region subproblem is needed to evaluate the new univariate function value as it has an explicit expression. Promising numerical results based on the new algorithm are reported.

LEAST squares; TIKHONOV regularization; LINEAR equations; UNIVARIATE analysis; CONVEX domains; MATHEMATICAL optimization

Computational Optimization & Applications, 2018, Vol 70, Issue 2, p571

0926-6003

Academic Journal

10.1007/s10589-018-0004-4