coneproj (version 1.10)

check_irred: Routine for Checking Irreducibility

Description

This routine checks the irreducibility of a set of edges, which are supposed to form the rows of a matrix. If a row is a positive linear combination of other rows, then it can be removed without affecting the problem; if there is a positive linear combination of rows of the matrix that equals the zero vector, then there is an implicit equality constraint in the matrix. In the former case, this routine delete the redundant rows and return a set of irreducible edges, while in the latter case, this routine will give the number of equality constraints in the matrix, and will leave this issue to the user to fix.

Usage

check_irred(mat)

Arguments

mat

A matrix whose rows are edges.

Value

edge

The edges kept after being checked about irreducibility.

reducible

A vector of the indice of the edges that are redundant in the original set of edges.

equal

A vector showing the number of equality constraints in the original set of edges.

References

Meyer, M. C. (1999) An extension of the mixed primal-dual bases algorithm to the case of more constraints than dimensions. Journal of Statistical Planning and Inference 81, 13--31.

Meyer, M. C. (2013b) A simple new algorithm for quadratic programming with applications in statistics. Communications in Statistics 42(5), 1126--1139.

Liao, X. and M. C. Meyer (2014) coneproj: An R package for the primal or dual cone projections with routines for constrained regression. Journal of Statistical Software 61(12), 1--22.

Examples

## Not run: 
#   data(TwoDamat)
#   dim(TwoDamat)
#   ans <- check_irred(TwoDamat)
#   ## End(Not run)