178 search results - page 36 / 36 » LSMR: An iterative algorithm for sparse least-squares proble... |
ORL
2006
13 years 5 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
NIPS
2004
13 years 6 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
DAM
2007
13 years 5 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...