Abstract: This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying ...

Implementation of the quasi Cauchy optimizer as described by Zhu et al. It is a member of the quasi Newton family. The Hessian is approximated by a diagonal matrix which satisfies the weak secant ...

The traversal implemented in the code is an left-to-right and up-to-down diagonal starting in the point (maximum row, minimum column) and finishing in the point (minimum row, maximum column). The ...