The minimal-norm Gauss-Newton method and some of its regularized variants
From MaRDI portal
Publication:2203382
DOI10.1553/etna_vol53s459zbMath1448.65030OpenAlexW3041724022MaRDI QIDQ2203382
Giuseppe Rodriguez, Federica Pes
Publication date: 6 October 2020
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol53/abstract.php?vol=53&pages=459-480
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of solutions to systems of equations (65H10)
Related Items (5)
An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces ⋮ Regularized minimal-norm solution of an overdetermined system of first kind integral equations ⋮ A projection method for general form linear least-squares problems ⋮ A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems ⋮ mngn
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- corner.m
- cosereg
- FDEMtools: a Matlab package for FDEM data inversion
- Restarted block Lanczos bidiagonalization methods
- Regularization methods for uniformly rank-deficient nonlinear least-squares problems
- Quasi-Newton approach to nonnegative image restorations
- Parameter determination for Tikhonov regularization problems in general form
- Old and new parameter choice rules for discrete ill-posed problems
- Inversion of multiconfiguration complex EMI data with minimum gradient support regularization: a case study
- On the convergence of a regularizing Levenberg-Marquardt scheme for nonlinear ill-posed problems
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Identifying the magnetic permeability in multi-frequency EM data inversion
- Regularization tools version \(4.0\) for matlab \(7.3\)
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- An adaptive pruning algorithm for the discrete L-curve criterion
- Regularization parameter determination for discrete ill-posed problems
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Regularized solution of a nonlinear problem in electromagnetic sounding
- A simplified generalized Gauss-Newton method for nonlinear ill-posed problems
- An Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems
- A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
- On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
- An analysis of Tikhonov regularization for nonlinear ill-posed problems under a general smoothness assumption
- Accelerated Gauss-Newton algorithms for nonlinear least squares problems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- TIGRA an iterative algorithm for regularizing nonlinear ill-posed problems
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Bouligand-Levenberg-Marquardt iteration for a non-smooth ill-posed inverse problem
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Tikhonov replacement functionals for iteratively solving nonlinear operator equations
This page was built for publication: The minimal-norm Gauss-Newton method and some of its regularized variants
