Changes between Version 18 and Version 19 of OfficialTolArchiveNetworkBysPrior

Timestamp:

Dec 26, 2010, 11:26:06 AM (14 years ago)

Author:

Víctor de Buen Remiro

Comment:

--

OfficialTolArchiveNetworkBysPrior

@@ -21 +21 @@
 of the likelihood (except an additive constant), its gradient and its hessian,
 and an optional set of constraining inequations, in order to define the feasible 
-region. Each inequation can be linear or not and the gradient must 
+region. Each inequation can be linear or not, but then the gradient must 
 be also calculated. Note that this implies that priors should be continuous and 
 two times differentiable and restrictions must be continuous and differerentiable,
-but this an admisible restricion in almost all cases.
+but this is an admisible restricion in almost all cases.
+
+In the base class will be the tools to index the subset of variables affected 
+by prior in the vector of all model variables.
+Thus prior methods can be programmed as if there were only them, driving a simple 
+vector.
 
 == Deterministic priors ==
@@ -207 +212 @@
  * take the maximum of lower bounds
  * take the minimum of upper bounds
+
+