The problem is that old ALGLIB 2.6 uses acceleration strategy which can't be used in the bound constrained setting. It was able to interleave iterations of Levenberg-Marquardt with iterations of preconditioned L-BFGS, but this trick does not work with bound constraints. At least with algorithm ALGLIB uses.
I still think on it, and have no satisfactory solution so far. Either we have support for bound constraints - OR - we have preconditioned inner L-BFGS. But we can't have both, and we can't have two versions of the algorithm, because it will make it too hard to debug and support.
|