Skip to search formSkip to main contentSkip to account menu

Gauss–Newton algorithm

Known as: Gauss-Newton method, Gauss–Newton method, Newton-Gauss 
The Gauss–Newton algorithm is used to solve non-linear least squares problems. It is a modification of Newton's method for finding a minimum of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We propose a globally convergent and robust Gauss-Newton algorithm for finding a (local) optimal solution of a non-convex and… 
2012
2012
State of the art visual odometry systems use bundle adjustment (BA) like methods to jointly optimize motion and scene structure… 
2011
2011
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany… 
2009
2009
We consider knot theories possessing a parity: each crossing is decreed odd or even according to some universal rule. If this… 
2005
2005
Simulated Annealing Gauss-Newton algorithm applied to neural network is put forward. It overcomes some limitation of the… 
2004
2004
. We present a Gauss-Newton-on-manifold approach for estimating the relative pose (position and orientation) between a 3D object… 
2001
2001
Based on the perspective view of non-linear model fitting, a new algorithm for space resection based on Levenberg-Marquardt… 
2000
2000
We propose a generic method for iteratively approximating various second-order gradient steps - Newton, Gauss-Newton, Levenberg… 
1995
1995
Recently a novel approach to nonlinear function approximation using hinging hyperplanes, was reported by L. Breiman [3]. In this…