Texonom
Texonom
/
Computing
Computing
/Computing Theory/Computability Theory/Problem Solving/Optimization/Optimization Algorithm/
Gauss-Newton Method
Search

Gauss-Newton Method

Created
Created
2021 Aug 8 7:57
Editor
Editor
Seonglae Cho
Creator
Creator
Seonglae Cho
Edited
Edited
2024 May 2 12:56
Refs
Refs
Gradient Descent
Carl F. Gauss

Extension of
Newton–Raphson method
for unlinear

Least Squares는 선형화를 가정하여 error의 최소화를 구하는 방법인데
Non-linear한 모델일 경우, 사용하는 방법 중 하나가 Gauss-Newton Method
 
 
 
Newton's method
In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function. The most basic version starts with a single-variable function f defined for a real variable x, the function's derivative f′, and an initial guess x0 for a root of f. If the function satisfies sufficient assumptions and the initial guess is close, then
Newton's method
https://en.wikipedia.org/wiki/Newton's_method
taeyoung96.github.io
https://taeyoung96.github.io/slam/SLAM_02/
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Computing Theory/Computability Theory/Problem Solving/Optimization/Optimization Algorithm/
Gauss-Newton Method
Copyright Seonglae Cho