Pages that link to "Item:Q2116040"
From MaRDI portal
The following pages link to An efficient Gauss-Newton algorithm for solving regularized total least squares problems (Q2116040):
Displaying 11 items.
- Two projection methods for regularized total least squares approximation (Q406473) (← links)
- A fast algorithm for solving regularized total least squares problems (Q836782) (← links)
- Remarks on the regularized Gauss-Newton method (Q1423565) (← links)
- A Gauss-Newton iteration for total least squares problems (Q1647655) (← links)
- The minimal-norm Gauss-Newton method and some of its regularized variants (Q2203382) (← links)
- DUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM (Q2970024) (← links)
- An efficient Newton-type method for the computation of ML estimators in a uniform linear array (Q5355748) (← links)
- A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state–space model in the presence of disturbance and uncertainty (Q5867067) (← links)
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces (Q6057154) (← links)
- A Gauss-Newton method for mixed least squares-total least squares problems (Q6126121) (← links)
- Regularized and structured tensor total least squares methods with applications (Q6614698) (← links)
