ancestor.find

index

<p>Matrix of <code>n.edges</code>-by-<code>2</code> dimension, where <code>n.edges</code>
is the number of directed edges in DAG. The first column has indices of
nodes that edges directing from, whereas the second column gives the indices
of nodes the corresponding edges directing towards.</p>

n.nodes

<p>Recursively finds all ancestor nodes in DAG for node with the given index.</p>

Implementation of the block coordinate descent procedure for
solving the proximal function of latent group Lasso, highlighted by
decomposing a DAG into several non-overlapping path graphs, and getting
closed-form solution for each path graph. The procedure was introduced
as Algorithm 4 in Yan and Bien (2017) <doi:10.1214/17-STS622>
"Hierarchical Sparse Modeling: A Choice of Two Group Lasso Formulations", and the
closed-form solution for each path graph is solved in Algorithm 3 of
that paper.

ancestor.find: Find ancestor nodes for a node in directed acyclic graph.

Description

Usage

Arguments

Value