ldp: Least Distance Problem
In MathsCell/nlsic: Non Linear Least Squares with Inequality Constraints
ldp R Documentation
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
MathsCell/nlsic documentation built on July 7, 2024, 6:53 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| ldp | R Documentation |
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
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.