Solves the saddlepoint equation \(K1(t; \theta) = y\) for a given CGF object.
It uses numeric optimization (via nloptr) to find the vector \(t\)
that satisfies \(K1(t; \theta) = y\).
If the CGF object offers an analytical solution
(see cgf_object$analytic_tvec_hat if available), you may prefer that
approach instead.
Arguments
- theta
Numeric vector of model parameters for which the CGF is defined.
- y
Numeric vector of observations.
- cgf
A CGF object (class
"CGF").- starting.tvec
Numeric start values for \(t\), defaults to
0for each element.- lb, ub
Numeric vectors for lower and upper bounds of \(t\), each having the same length as
starting.tvec. Defaults are-InfandInf.- sadd.eqn.opts
List of options for the
nloptroptimizer. Defaults tolist(ftol_abs = 0, maxeval = 1e3, xtol_rel = 1.0e-12, print_level = 0), with algorithm fixed at"NLOPT_LD_SLSQP".- warn_residual
Logical. If
TRUE, compute the residual \(\|\mathit{K1}(t^*;\theta)-y\|_\infty\) and warn if it exceedstol.- tol
Numeric tolerance for residual checks (default
1e-4).