Changes between Version 3 and Version 4 of OfficialTolArchiveNetworkBysPrior

Timestamp:

Dec 25, 2010, 6:52:28 PM (14 years ago)

Author:

Víctor de Buen Remiro

Comment:

--

OfficialTolArchiveNetworkBysPrior

@@ -16 +16 @@
 an unconstrainined normal.
 
-In order to be estimated with NonLinGloOpt (max-likelihood) and BysSampler 
+In order to be estimated with [wiki:OfficialTolArchiveNetworkNonLinGloOpt NonLinGloOpt] 
+(max-likelihood) and [wiki:OfficialTolArchiveNetworkBysSampler  BysSampler ]
 (Bayesian sampler), each prior must define methods to calculate the logarithm
 of the likelihood (except an additive constant), its gradient and its hessian,
@@ -37 +38 @@
 
 === Domain prior ===
-The easiest way, but one of the most important, to define non informative 
-prior information is to stablish a domain interval for one or more variables. 
+The easiest way, but one of the most important, to define a non informative 
+prior, is to stablish a domain interval for one or more variables. 
 
 In this cases, you mustn't to define the log-logarithm nor the constraining 
@@ -46 +47 @@
 [[LatexEquation( \beta\in\Omega\Longleftrightarrow l_{k}\leq\beta_{i_k}\leq u_{k}\wedge-\infty\leq l_{k}<u_{k}\leq\infty\forall k=1\ldots r )]]
 
+If both lower and upper bounds are non finite, then we call it the neutral 
+prior, that is equivalent to don't define any prior.
+
 === Polytope prior ===
-A polytope is defined by a system of arbitrary linear inequalities [[BR]]
+A polytope prior is defined by a system of compatible linear inequalities [[BR]]
 
 [[LatexEquation( A\beta\leq a\wedge A\in\mathbb{R}^{r\times n}\wedge a\in\mathbb{R}^{r} )]]
@@ -56 +60 @@
 
 We can implement this type of prior by means of a set of [[LatexEquation( r )]] 
-inequations but, since NonLinGloOpt doesn't have any special behaviour for linear 
-inequations, it could be an inefficient implementation.
-
-However we can define just one non linear inequation that is equivalent to the
-full set of linear inequations. If we define 
+inequations but, since [wiki:OfficialTolArchiveNetworkNonLinGloOpt NonLinGloOpt] 
+doesn't have any special behaviour for linear inequations, it could be an 
+inefficient implementation. However we can define just one non linear inequation 
+that is equivalent to the full set of linear inequations. If we define 
 
 [[LatexEquation( d\left(\beta\right)=A\beta-a=\left(d_{k}\left(\beta\right)\right)_{k=1\ldots r} )]]