



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Nlr is a statistical software used for estimating the parameters of non-linear regression models. It uses the levenberg-marquardt algorithm to minimize the objective function and find the least square estimates of the parameters. The nlr methodology, the goal of the estimation, the algorithm used, and the statistics printed when the iteration terminates.
Typology: Study notes
1 / 5
This page cannot be seen from the preview
Don't miss anything!




1
NLR produces the least square estimates of the parameters for models that are not linear in their parameters. Unlike in other procedures, the weight function is not treated as a case replicate in NLR.
Consider the model
f = f 1 x ,Θ 6
where Θ is a p × 1 parameter vector, x is a vector of independent variables, and f is a function of x and Θ.
Find the least square estimate Θ ∗^ of Θ such that Θ ∗^ minimizes the objective function
F (^) 1 6Θ = R WR ′ (1)
where
∗
R y f f f x i n W W
n i i i i i n
1
1
1 6
1 6
Diag
and n is the number of cases. For case i, yi is the observed dependent variable, xi is the vector of observed independent variables, Wi is the weight function which can be a function of Θ.
The gradient of F at Θ (^) j is defined as
∇ F = 2 J ′⋅j WR
where J ⋅ j is the jth column of the n × pJacobian matrix J whose (^) 1 6i j, th element J (^) ij is defined by
W f ij
i i
i j
i j
The modified Levenberg-Marquardt algorithm that was proposed by Moré (1977) and is contained in MINPACK is used in NLR to solve equation (1).
At stage k + 1 , k=0 1 2, , , K
f (^) i f k i
1 6 (^) = 1 6F
Θ (^) , R (^) i y f k i i
= − , Fk = F Θ1 6k^ , and J 1 6k^ = J Θ1 6k
F 4 Θ k^ + h (^) k 9
When iteration terminates, the following statistics are printed.
The asymptotic standard error of Θ ∗j^ is estimated by the square root of the jth diagonal element a (^) jj of A , where
′
∗ ∗ ∗ ∗
n p
4 Θ 9 1
and J ∗^ and W ∗^ are the Jacobian matrix J and weight function W evaluated at Θ ∗^ , respectively.
Θ ∗j ± t 1 0 975. ,n −p a (^6) ii
where
D = Diag 4 a 11, K,a (^) pp 9
and aii is the ith diagonal element of A.
Source df Sum of Squares
Residual n^ −^ p
F 4 Θ ∗ 9
Regression p^ SS (^) uncorrected − F 4 Θ ∗ 9
Uncorrected Total n^ SSuncorrected
Corrected Total n − (^1) SS y Wi i
n uncorrected −^
∗
=
∑
2
1
4 Θ 9
where
SS W y
y W y W
i i
n i
i i
n i i i
n
uncorrected =
3 8
3 8 3 8
1
2
1 1
Moré, J. J. 1977. The Levenberg-Marquardt algorithm: implementation and theory in numerical analysis. In: Lecture Notes in Mathematics 630, G. A. Watson, ed. Berlin: Springer-Verlag. 105–116.