Ricart–Agrawala algorithm - Revision history

en>Trinidade: Reverted 1 edit by 1.22.35.90 identified as test/vandalism using STiki

2014-10-10T19:05:44Z

Reverted 1 edit by 1.22.35.90 identified as test/vandalism using STiki

← Older revision		Revision as of 21:05, 10 October 2014
Line 1:		Line 1:
	~~'''BHHH'''~~ is ~~an [[Optimization (mathematics)\|optimization]] [[algorithm]] in [[numerical optimization]] similar to [[Gauss–Newton algorithm]]. It is an [[Acronym and initialism\|acronym]] of~~ the ~~four originators: Berndt, B. Hall, R. Hall,~~ and ~~[[Jerry Hausman]]~~.		Wilber Berryhill is the title his parents gave him and he completely digs that title. Some time in the past he chose to live in North Carolina and he doesn't plan on changing it. I am presently a travel agent. To climb is something I truly appreciate performing.<br><br>Here is my homepage ... online psychics ([http://www.onbizin.co.kr/xe/?document_srl=320614 click the next internet page])

	~~==Usage==~~
	~~If a [[nonlinear]] model is fitted to~~ the ~~[[data]] one often needs~~ to estimate [[coefficient]]s through [[Optimization (mathematics)\|optimization]]. A number of optimisation algorithms have the following general structure. Suppose that the function to be optimized is ''Q''('~~'β'')~~. ~~Then the algorithms are iterative, defining a sequence of approximations, ''β<sub>k</sub>'' given by~~
	~~:<math>\beta_{k+1}=\beta_{k}-\lambda_{k}A_{k}\frac{\partial Q}{\partial \beta}(\beta_{k}),</math>,~~

	where <math>\beta_{k}</math> is the parameter estimate at step k, and <math>\lambda_{k}</math> is a parameter (called step size) which partly determines the particular algorithm. For the BHHH algorithm ''λ<sub>k</sub>'' is determined by calculations within a given iterative step, involving a line-search until a ~~point ''β<sub>k''+1</sub> is found satisfying certain criteria~~. ~~In addition, for the BHHH algorithm, ''Q'' has the form~~

	~~:<math>Q = \sum_{i=1}^{N} Q_i</math>~~
	~~and ''A''~~ is ~~calculated using~~
	~~:<math>A_{k}=\left[\sum_{i=1}^{N}\frac{\partial \ln Q_i}{\partial \beta}(\beta_{k})\frac{\partial \ln Q_i}{\partial \beta}(\beta_{k})'\right]^{-1} .</math>~~
	~~In other cases, e.g~~. ~~[[Newton-Raphson]],~~ <~~math~~>~~A_{k}~~<~~/math~~> ~~can have other forms. The BHHH algorithm has the advantage that, if certain conditions apply, convergence of the iterative procedure~~ is ~~guaranteed.{{cn\|date=March 2013}}~~

	~~==Literature==~~
	*Berndt, E.~~, B~~. ~~Hall, R~~. ~~Hall, and J. Hausman,~~ (~~1974),~~ [http://~~elsa~~.~~berkeley~~.~~edu~~/~~~bhhall~~/~~papers/BerndtHallHallHausman74.pdf “Estimation and Inference in Nonlinear Structural Models”~~]~~, ''Annals of Economic and Social Measurement'', 3, 653–665.~~
	*Luenberger, D. (1972)~~, ''Introduction to Linear and Nonlinear Programming'', Addison Wesley, Reading Massachusetts.~~
	*Gill, P., W. Murray, and M. Wright, (1981), ''Practical Optimization'', Harcourt Brace and Company, London
	*Sokolov, S.N., and I.N. Silin (1962), “Determination of the coordinates of the minima of functionals by the linearization method”, Joint Institute for Nuclear Research preprint D-810, Dubna.

	~~{{DEFAULTSORT:Bhhh Algorithm}}~~
	~~[[Category:Econometrics]]~~
	~~[[Category:Optimization algorithms and methods]]~~

14.139.185.114: /* Algorithm */

2013-11-22T12:31:07Z

Algorithm

← Older revision		Revision as of 14:31, 22 November 2013
Line 1:		Line 1:
	~~Hi there~~, ~~I am Alyson Boon even though it~~ is ~~not~~ the ~~name on my birth certificate~~. ~~To play lacross~~ is 1 of the ~~issues she loves most~~. ~~Alaska~~ is ~~where he~~'~~s always been living~~. ~~Since he was 18 he~~'~~s been working as an info officer but he ideas on altering it~~.<br><br>~~Here~~ is ~~my site -~~ [http://~~ustanford~~.~~com/index~~.~~php?do=~~/~~profile-38218~~/~~info~~/ ~~love psychic~~]		'''BHHH''' is an [[Optimization (mathematics)\|optimization]] [[algorithm]] in [[numerical optimization]] similar to [[Gauss–Newton algorithm]]. It is an [[Acronym and initialism\|acronym]] of the four originators: Berndt, B. Hall, R. Hall, and [[Jerry Hausman]].

			==Usage==
			If a [[nonlinear]] model is fitted to the [[data]] one often needs to estimate [[coefficient]]s through [[Optimization (mathematics)\|optimization]]. A number of optimisation algorithms have the following general structure. Suppose that the function to be optimized is ''Q''(''β''). Then the algorithms are iterative, defining a sequence of approximations, ''β<sub>k</sub>'' given by
			:<math>\beta_{k+1}=\beta_{k}-\lambda_{k}A_{k}\frac{\partial Q}{\partial \beta}(\beta_{k}),</math>,

			where <math>\beta_{k}</math> is the parameter estimate at step k, and <math>\lambda_{k}</math> is a parameter (called step size) which partly determines the particular algorithm. For the BHHH algorithm ''λ<sub>k</sub>'' is determined by calculations within a given iterative step, involving a line-search until a point ''β<sub>k''+1</sub> is found satisfying certain criteria. In addition, for the BHHH algorithm, ''Q'' has the form

			:<math>Q = \sum_{i=1}^{N} Q_i</math>
			and ''A'' is calculated using
			:<math>A_{k}=\left[\sum_{i=1}^{N}\frac{\partial \ln Q_i}{\partial \beta}(\beta_{k})\frac{\partial \ln Q_i}{\partial \beta}(\beta_{k})'\right]^{-1} .</math>
			In other cases, e.g. [[Newton-Raphson]], <math>A_{k}</math> can have other forms. The BHHH algorithm has the advantage that, if certain conditions apply, convergence of the iterative procedure is guaranteed.{{cn\|date=March 2013}}

			==Literature==
			*Berndt, E., B. Hall, R. Hall, and J. Hausman, (1974), [http://elsa.berkeley.edu/~bhhall/papers/BerndtHallHallHausman74.pdf “Estimation and Inference in Nonlinear Structural Models”], ''Annals of Economic and Social Measurement'', 3, 653–665.
			*Luenberger, D. (1972), ''Introduction to Linear and Nonlinear Programming'', Addison Wesley, Reading Massachusetts.
			*Gill, P., W. Murray, and M. Wright, (1981), ''Practical Optimization'', Harcourt Brace and Company, London
			*Sokolov, S.N., and I.N. Silin (1962), “Determination of the coordinates of the minima of functionals by the linearization method”, Joint Institute for Nuclear Research preprint D-810, Dubna.

			{{DEFAULTSORT:Bhhh Algorithm}}
			[[Category:Econometrics]]
			[[Category:Optimization algorithms and methods]]

en>Dicklyon: moved Ricart-Agrawala algorithm to Ricart–Agrawala algorithm: two names -> en dash

2011-08-11T22:50:03Z

moved Ricart-Agrawala algorithm to Ricart–Agrawala algorithm: two names -> en dash

New page

Hi there, I am Alyson Boon even though it is not the name on my birth certificate. To play lacross is 1 of the issues she loves most. Alaska is where he's always been living. Since he was 18 he's been working as an info officer but he ideas on altering it.<br><br>Here is my site - [http://ustanford.com/index.php?do=/profile-38218/info/ love psychic]