1987
DOI: 10.1137/0908085
|View full text |Cite
|
Sign up to set email alerts
|

A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
158
0
1

Year Published

2004
2004
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 328 publications
(160 citation statements)
references
References 14 publications
1
158
0
1
Order By: Relevance
“…For a unified treatment of these methods, and some comparisons, see [1]. The direct solution of (3) trades the subproblems for t i (a) for an increase in the number of variables, and generates orthogonal distances only in the limit: methods which exploit the structure of the Jacobian in Gauss-Newton (or Levenberg-Marquardt) methods are given in [6,10]. Which approach should be used depends mainly on whether or not the points x(a, t i (a)) are easy to calculate.…”
Section: C189mentioning
confidence: 99%
See 1 more Smart Citation
“…For a unified treatment of these methods, and some comparisons, see [1]. The direct solution of (3) trades the subproblems for t i (a) for an increase in the number of variables, and generates orthogonal distances only in the limit: methods which exploit the structure of the Jacobian in Gauss-Newton (or Levenberg-Marquardt) methods are given in [6,10]. Which approach should be used depends mainly on whether or not the points x(a, t i (a)) are easy to calculate.…”
Section: C189mentioning
confidence: 99%
“…(7) (2) (1) (7) (2) (1) (7) (2) (1) (7) (2) Now consider the l p distance regression problem (3). For the case p = 2 the structure of the Jacobian matrix in (9) can be exploited as in odrpack or funke [5,6,10]. But in this more general case, this structure can also be exploited in the least squares subproblem which, as shown, gives the GaussNewton step asymptotically.…”
Section: This Is a Descent Step For F (A) Ifmentioning
confidence: 99%
“…(ODR) algorithm (Boggs et al 1987(Boggs et al , 1992 6 , we determined the three parameters, that are shown in Table 1. The ODR uses the uncertainties on both variables to determine the best fit.…”
Section: Color-metallicity Relationmentioning
confidence: 99%
“…Fitzgibbon fitted 3D complex surfaces using the LevenbergMarquardt algorithm by minimising the Huber estimator in the z direction [30]. Boggs et al proposed an algorithm to minimize the mean squared orthogonal distance for explicit complex surfaces [31]. Sourlier [32] discussed the fitting of parametric surfaces based on orthogonal distance regression.…”
Section: Review Of Related Workmentioning
confidence: 99%