4 ms·
Your first statement assumes that linear programming solvers can be massively parallelized. Can they?
by blt 6y ago
Your first statement assumes that linear programming solvers can be massively parallelized. Can they?
- sudosysgen 6y agoIIRC, yes they can be massively parallelized because they reduce into matrix algebra. One could also go even further and make an ASIC for solving these problems à la Tensor Cote.
- sudosysgen 6y agoI'm being downvoted for some reason, so here is a paper on a massively parallel linear programming solver that exploits the fact that the problem can be reduced to matrix operations : https://www.tandfonline.com/doi/abs/10.1080/10637199408915470 https://www.tandfonline.com/doi/abs/10.1080/1063719940891547... Seems like I remembered my optimization class correctly after all!