Please use this identifier to cite or link to this item:
|Title: ||Comparing double minimization and zigzag algorithms in Joint Regression Analysis: the complete case|
|Authors: ||Pereira, Dulce G.|
Mexia, João T.
|Editors: ||Krutchkoff, Richard|
|Keywords: ||Joint Regression Analysis|
L2 environmental indexes
|Issue Date: ||2010|
|Publisher: ||Taylor & Francis|
|Citation: ||Comparing double minimization and zigzag algorithms in Joint Regression Analysis: the complete case
Dulce Gamito Pereira, João Tiago Mexia
Journal of Statistical Computation and Simulation
Vol. 80, Iss. 2, 2010|
|Abstract: ||Joint Regression Analysis is a widely used technique for cultivar comparison.
For each cultivar a linear regression is adjusted on a non observable regressor: the environmental index. This index measures, for each block, the corresponding productivity.
When all cultivars are present in all the blocks in the field trials the series of experiments is complete.
To carry out the minimization of the sum of sums of squares of residuals in order to estimate the coefficients of the regressions and the environmental indexes an iterative algorithm, the zigzag algorithm was introduced, see Mexia et al. (1999).
This algorithm performs well, see, e.g., Mexia et al. (2001) and Mexia and Pereira (2001), but it has not been shown that it converges to the absolute minimum of the goal function.
We presented, see Pereira and Mexia (2008) an alternative algorithm and showed that, in the complete case, it converges to the absolute minimum.
Through an example it was shown that the results obtained using both algorithms agreed. We now analyse the reason behind the agreement between both algorithms.|
|Appears in Collections:||CIMA - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.