TRUE if and only if
p is contained in
the convex hull of the points given as the rows of
a matrix, each row is tested individually, and
TRUE is returned if
all rows are in the convex hull.
shrink_into_CH() returns the coefficient by which rows of
p can be scaled towards or away from point
m in order for all of them to be in the convex hull of
M or on its boundary.
is.inCH(p, M, verbose = FALSE, ...) shrink_into_CH( p, M, m = NULL, verbose = FALSE, ..., solver = c("glpk", "lpsolve") )
A d-dimensional vector or a matrix with d columns
An n by d matrix. Each row of
A logical or an integer to control the amount of
progress and diagnostic information to be printed.
arguments passed directly to linear program solver
A character string selecting which solver to use; by default, tries
is.inCH() was originally written for the "stepping" algorithm of
Hummel et al (2012). See Krivitsky, Kuvelkar, and Hunter (2022) for
detailed discussion of algorithms used in
Logical, telling whether
p is (or all rows of
in the closed convex hull of the points in
is.inCH() has been deprecated in favour of
shrink_into_CH(), which returns the optimal step length instead
of a yes-or-no test. In general,
equivalent to 'is.inCH(...).
Hummel, R. M., Hunter, D. R., and Handcock, M. S. (2012), Improving Simulation-Based Algorithms for Fitting ERGMs, Journal of Computational and Graphical Statistics, 21: 920-939.
Krivitsky, P. N., Kuvelkar, A. R., and Hunter, D. R. (2022). Likelihood-based Inference for Exponential-Family Random Graph Models via Linear Programming. arXiv preprint arXiv:2202.03572. https://arxiv.org/abs/2202.03572
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.