Description |
Implemented fitting minimum circumscribed (MCC), minimum zone (MZC), maximum inscribed (MIC) circles/spheres to N-dimensional data.
Two algorithms are provided:
* robust (although less efficient) NLC one, based on ALGLIB nonlinearly constrained solver. This algorithm shows good convergence properties.
* fast inexact SLP (sequential linear programming) one, based on ALGLIB linearly constrained solver.
NOTE: SLP approach to MCC/MZC/MIC is recommended by many authors; however, empirical testing demonstrated that linearization of the problem often breaks down near true solution (validated in MATLAB; it is deficiency of linearization, not solver used for such model). Thus, SLP solver often fails to converge to more than 3-5 digits of precision. However, it is 10-20 times faster than NLC, and on some problems it works good enough. That's why we included it as non-standard option. |