Description |
Two promising derivative-free NLS solvers were implemented:
* DFO-LSA, a modified version of DFO-LS (Cartis, Fiala, Marteau, Roberts), with "A" standing for ALGLIB in order to distinguish it from the original version. This algorithm achieves the smallest function evaluations count, but has relatively high iteration overhead and no callback parallelism potential (it issues target evaluation requests one by one, so they can not be parallelized). Recommended for expensive targets with no parallelism support.
* 2PS (two-point stencil) - an easily parallelized algorithm developed by ALGLIB Project. It needs about 3x-4x more target evaluations than DFO-LSA (the ratio has no strong dependence on the problem size), however it issues target evaluation requests in large batches, so they can be computed in parallel. Additionally it has low iteration overhead, so it can be better suited for problems with cheap targets that DFO-LSA.
Both solvers are provided by the new NLS subpackage. |