An efficient Gauss-Newton algorithm for solving regularized total least squares problems
From MaRDI portal
Publication:2116040
Recommendations
- Efficient Algorithms for Solution of Regularized Total Least Squares
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- Solving regularized total least squares problems based on eigenproblems
- Computational experiments on the Tikhonov regularization of the total least squares problem
- A fast algorithm for solving regularized total least squares problems
Cites work
- scientific article; zbMATH DE number 51511 (Why is no real title available?)
- scientific article; zbMATH DE number 1748541 (Why is no real title available?)
- scientific article; zbMATH DE number 852525 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Gauss-Newton iteration for total least squares problems
- A constrained eigenvalue problem
- A fast algorithm for solving regularized total least squares problems
- A new \(L\)-curve for ill-posed problems
- An Analysis of the Total Least Squares Problem
- Bibliography on total least squares and related methods
- Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems
- Determination of regularization parameter via solving a multi-objective optimization problem
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Efficient determination of the hyperparameter in regularized total least squares problems
- Efficient estimation of regularization parameters via downsampling and the singular value expansion, downsampling regularization parameter estimation
- Efficiently solving total least squares with Tikhonov identical regularization
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Estimation of the regularization parameter in linear discrete ill-posed problems using the Picard parameter
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Fast high-resolution image reconstruction using Tikhonov regularization based total least squares
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- GCV for Tikhonov regularization by partial SVD
- L-curve and curvature bounds for Tikhonov regularization
- Large-scale Tikhonov regularization of total least squares
- Least squares data fitting with applications
- Methods for large scale total least squares problems
- Multi-objective optimization using evolutionary algorithms
- Multicriteria Optimization
- 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
- Old and new parameter choice rules for discrete ill-posed problems
- On a quadratic eigenproblem occurring in regularized total least squares
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- Overview of total least-squares methods
- Parameter determination for Tikhonov regularization problems in general form
- Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
- Regularization by Truncated Total Least Squares
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Regularized total least squares based on quadratic eigenvalue problem solvers
- Solving regularized total least squares problems based on eigenproblems
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- The parameter choice rules for weighted Tikhonov regularization scheme
- Tikhonov Regularization and Total Least Squares
- Trade-off analysis approach for interactive nonlinear multiobjective optimization
- Two projection methods for regularized total least squares approximation
Cited in
(13)- A Gauss-Newton method for mixed least squares-total least squares problems
- The minimal-norm Gauss-Newton method and some of its regularized variants
- Two projection methods for regularized total least squares approximation
- An efficient Newton-type method for the computation of ML estimators in a uniform linear array
- Remarks on the regularized Gauss-Newton method
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- Dual regularized total least squares solution from two-parameter trust-region algorithm
- A fast algorithm for solving regularized total least squares problems
- A Gauss-Newton iteration for total least squares problems
- Regularized and structured tensor total least squares methods with applications
- 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
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces
- Efficient Algorithms for Solution of Regularized Total Least Squares
This page was built for publication: An efficient Gauss-Newton algorithm for solving regularized total least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116040)
