Provides elastic net penalized maximum likelihood estimator for structural equation models (SEM). The package implements `lasso` and `elastic net` (l1/l2) penalized SEM and estimates the model parameters with an efficient block coordinate ascent algorithm that maximizes the penalized likelihood of the SEM.  Hyperparameters are inferred from cross-validation (CV).  A Stability Selection (STS) function is also available to provide accurate causal effect selection. The software achieves high accuracy performance through a `Network Generative Pre-trained Transformer` (Network GPT) Framework with two steps: 1) pre-trains the model to generate a complete (fully connected) graph; and 2) uses the complete graph as the initial state to fit the `elastic net` penalized SEM.

Implements the SparseStep model for solving regression
    problems with a sparsity constraint on the parameters. The SparseStep
    regression model was proposed in Van den Burg, Groenen, and Alfons (2017)
    <arXiv:1701.06967>. In the model, a regularization term is added to the
    regression problem which approximates the counting norm of the parameters.
    By iteratively improving the approximation a sparse solution to the
    regression problem can be obtained.  In this package both the standard
    SparseStep algorithm is implemented as well as a path algorithm which uses
    golden section search to determine solutions with different values for the
    regularization parameter.

Wrapper around the 'SVDLIBC' library for (truncated) singular value decomposition of a sparse matrix.
             Currently, only sparse real matrices in Matrix package format are supported.

Offers a fast algorithm for fitting solution paths of sparse SVM models with lasso or elastic-net regularization. Reference: Congrui Yi and Jian Huang (2017) <doi:10.1080/10618600.2016.1256816>.

Computes sparse vector autoregressive 				coefficients and precision matrices for time series 		chain graphical models. Fentaw Abegaz and Ernst Wit (2013)	<doi:10.1093/biostatistics/kxt005>.