On the nonnegative least squares
In this document, we study the nonnegative least squares primal-dual method for solving linear programming problems. In particular, we investigate connections between this primal-dual method and the classical Hungarian method for the assignment problem. Firstly, we devise a fast procedure for com...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/31768 |