Some heuristic and deterministic global optimization algorithms to solve the problem of Multidimensional Scaling
Abstract:
Multidimensional scaling (MDS) which is a fundamental problem in data analysis, can be formulated as a nonlinear global optimization problem. In order to solve it, some local, heuristic and global optimization methods are implemented. In another hand, to perform our new heuristic approach, the MDS problem is studied by using a multistart LevenbergMarquardt method and, also for some small examples, by developping two rigourous global optimization algorithms. Nevertheless, these deterministic approaches have some identified limits, which permit to extend these methods by making some accelerating or heuristic advices.
Citations
| 544 | Interval Analysis – Moore - 1966 |
| 144 | Global optimization: deterministic approaches, 2nd ed – Horst, Tuy - 1993 |
| 130 | The Levenberg-Marquardt Algorithm: Implementation and Theory – MorĂ© - 1978 |
| 126 | New Computer Methods for Global Optimization – Ratschek, Rokne - 1988 |
| 116 | Multidimensional scaling – Kruskal, Wish - 1978 |
| 13 | Distance geometry optimization for protein structures – E, WU - 1999 |
| 1 | Kearfott R.B.: 1996, 'The Cluster Problem in Multivariate Global Optimization – Du |
| 1 | Zilinskas A.: 1994 'A class of test functions for global optimization – Mathar |
| 1 | Nogar`ede B., Lagouanelle J.L.: 1998, 'Optimal Design of Electromechanical Atuators: New Method based on Global Optimization – Messine |
| 1 | Rouz'e V., Hirriart-Urruty J.B.: 1998 'Comparison of Public-domain Software for Black-box Global Optimization – Mongeau, Karsenty |

