ldp {nlsic}

Least Distance Problem

Description

Solve least distance programming: find x satisfying u%*%x >= co and s.t. min(||x||) by passing to nnls (non negative least square) problem.

Usage

ldp(u, co, rcond = 1e+10)

Arguments

u

a dense matrix of inequality constraints

co

a right hand side vector of inequality constraints

rcond

maximal condition number for determining rank deficient matrix

Value

solution vector or NULL if constraints are unfeasible