An efficient Gauss-Newton algorithm for solving regularized total least squares problems
From MaRDI portal
Publication:2116040
DOI10.1007/s11075-021-01145-2zbMath1490.65073OpenAlexW3174295122WikidataQ114224297 ScholiaQ114224297MaRDI QIDQ2116040
Publication date: 16 March 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01145-2
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
A Gauss-Newton method for mixed least squares-total least squares problems, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- Overview of total least-squares methods
- Two projection methods for regularized total least squares approximation
- Efficient determination of the hyperparameter in regularized total least squares problems
- Bibliography on total least squares and related methods
- L-curve and curvature bounds for Tikhonov regularization
- The parameter choice rules for weighted Tikhonov regularization scheme
- A fast algorithm for solving regularized total least squares problems
- A new \(L\)-curve for ill-posed problems
- Solving regularized total least squares problems based on eigenproblems
- On a quadratic eigenproblem occurring in regularized total least squares
- A constrained eigenvalue problem
- Efficiently solving total least squares with Tikhonov identical regularization
- Parameter determination for Tikhonov regularization problems in general form
- A Gauss-Newton iteration for total least squares problems
- GCV for Tikhonov regularization by partial SVD
- Large-scale Tikhonov regularization of total least squares
- Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
- Trade-off analysis approach for interactive nonlinear multiobjective optimization
- Old and new parameter choice rules for discrete ill-posed problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Determination of regularization parameter via solving a multi-objective optimization problem
- Efficient estimation of regularization parameters via downsampling and the singular value expansion, downsampling regularization parameter estimation
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Regularized total least squares based on quadratic eigenvalue problem solvers
- Methods for Large Scale Total Least Squares Problems
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Regularization by Truncated Total Least Squares
- Estimation of the Regularization Parameter in Linear Discrete Ill-Posed Problems Using the Picard Parameter
- Multiplicative Noise and Blur Removal by Framelet Decomposition and <inline-formula> <tex-math notation="LaTeX">$l_{1}$ </tex-math> </inline-formula>-Based L-Curve Method
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Tikhonov Regularization and Total Least Squares
- Fast High-Resolution Image Reconstruction Using Tikhonov Regularization Based Total Least Squares
- Multicriteria Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
