Rapid heuristic projection on simplicial cones
arXiv:1001.1928
Abstract
A very fast heuristic iterative method of projection on simplicial cones is presented. It consists in solving two linear systems at each step of the iteration. The extensive experiments indicate that the method furnishes the exact solution in more then 99.7 percent of the cases. The average number of steps is 5.67 (we have not found any examples which required more than 13 steps) and the relative number of steps with respect to the dimension decreases dramatically. Roughly speaking, for high enough dimensions the absolute number of steps is independent of the dimension.
Affiliations of the authors have been added. In reference [2] "dykstra's" have been changed to "Dykstra's"
Cited by in corpus (4)
- A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint
- Replacing projection on finitely generated convex cones with projection on bounded polytopes
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- Projection onto simplicial cones by a semi-smooth Newton method