diff --git a/dev/.documenter-siteinfo.json b/dev/.documenter-siteinfo.json index f8597d5..9a23481 100644 --- a/dev/.documenter-siteinfo.json +++ b/dev/.documenter-siteinfo.json @@ -1 +1 @@ -{"documenter":{"julia_version":"1.11.1","generation_timestamp":"2024-11-15T13:53:14","documenter_version":"1.8.0"}} \ No newline at end of file +{"documenter":{"julia_version":"1.11.1","generation_timestamp":"2024-11-15T14:59:03","documenter_version":"1.8.0"}} \ No newline at end of file diff --git a/dev/Likelihood/index.html b/dev/Likelihood/index.html index 0651fb3..1047dfb 100644 --- a/dev/Likelihood/index.html +++ b/dev/Likelihood/index.html @@ -71,4 +71,4 @@ \\ S(t|\lambda,k)=& 1-I(k,\lambda t)\\ \ln S(t|\alpha,\kappa)=&\ln(1-I(\exp(\kappa)), \exp(\ln(t)-\alpha))\\ -\end{aligned}$
Where we define $I(k,s)$ as the upper incomplete gamma function ratio given by
\[I(k,s) = \frac{\int_o^s t^{k-1}\exp(-t)dt}{\Gamma(k)}\]
(see gamma_inc
function from SpecialFunctions.jl
)
(not yet implemented)
In the Cox model, the partial-likelihoods are used in place of the likelihood function. These models are are modeled directly in terms of hazard ratios, allowing that the baseline hazard can be an arbitrary distribution. The Cox models implemented here are semi-parametric because they include a combination of parametric (hazard ratios) and non-parametric (baseline hazard) components. Cox's original likelihood is used here, and, in place of tied survival times, two different options are implemented for addressing ties. See the survival
[surv] package vignette for original citations and methods for baseline hazard and partial-likelihood calculations.
This is the default in coxph (documentation in progress)
Documentation in progress
Documentation in progress
Fitting algorithms include direct calculation, hard-coded Newton-Raphson algorithms, and optimization algorithms from the Optim.jl
module:
BFGS
algorithm from Optim.jl
, supplemented with analytic gradient and Hessian using a Hager-Zhang line-search algorithm and static scaling of the P matrixBFGS
algorithm from Optim.jl
utilizing forward differencing to calculate gradient and approximate Hessian using a quadratic backtracking line-search algorithm with an initial quadratic approximation for scaling the P matrixSettings
This document was generated with Documenter.jl version 1.8.0 on Friday 15 November 2024. Using Julia version 1.11.1.