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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

In this paper we propose a quasi-Newton algorithm for the celebrated nonnegative matrix factorization (NMF) problem. The proposed…

2014

The use of simultaneous sources in geophysical inverse problems has revolutionized the ability to deal with large scale data sets…

2011

Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany…

2010

In the real-life engineering practice, non-linear regression models have to be designed rather often. To ensure their technical…

2009

We consider knot theories possessing a parity: each crossing is decreed odd or even according to some universal rule. If this…

2004

. We present a Gauss-Newton-on-manifold approach for estimating the relative pose (position and orientation) between a 3D object…

2000

We propose a generic method for iteratively approximating various second-order gradient steps - Newton, Gauss-Newton, Levenberg…

1995

Recently a novel approach to nonlinear function approximation using hinging hyperplanes, was reported by L. Breiman [3]. In this…

1992

An adaptive approach for estimating all (or some) of the orthogonal eigenvectors of the data covariance matrix (of a time series…

1980