lsi | R Documentation |

solve linear least square problem (min ||A%*%x-b||)
with inequality constraints u%%x>=co*

```
lsi(a, b, u = NULL, co = NULL, rcond = 1e+10, mnorm = NULL, x0 = NULL)
```

`a` |
dense matrix A or its QR decomposition |

`b` |
right hand side vector. Rows containing NA are dropped. |

`u` |
dense matrix of inequality constraints |

`co` |
right hand side vector of inequality constraints |

`rcond` |
maximal condition number for determining rank deficient matrix |

`mnorm` |
dummy parameter |

`x0` |
dummy parameter |

Method:

reduce the problem to ldp (min(xat*xa) => least distance programming)

solve ldp

change back to x

If b is all NA, then a vector of NA is returned.

mnrom, and x0 are dummy parameters which are here to make lsi() compatible with lsi_ln() argument list

solution vector whose attribute 'mes' may contain a message about possible numerical problems

lsi_ln, ldp, base::qr

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.