Method of constrained global optimization
- 25 April 1994
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 72 (17) , 2671-2674
- https://doi.org/10.1103/physrevlett.72.2671
Abstract
We present a new method for optimization: constrained global optimization (CGO). CGO iteratively uses a Glauber spin flip probability and the Metropolis algorithm. The spin flip probability allows changing only the values of variables contributing excessively to the function to be minimized. We illustrate CGO with two problems—Thomson’s problem of finding the minimum-energy configuration of unit charges on a spherical surface, and a problem of assigning offices—for which CGO finds better minima than other methods. We think CGO will apply to a wide class of optimization problems.Keywords
This publication has 12 references indexed in Scilit:
- The arrangement of point charges with tetrahedral and octahedral symmetry on the surface of a sphere with minimum Coulombic potential energyActa Crystallographica Section A Foundations of Crystallography, 1993
- Application of fast simulated annealing to optimization of conformal radiation treatmentsMedical Physics, 1993
- Energies and spacings of point charges on a sphereJournal of Physics A: General Physics, 1992
- The distribution of point charges on the surface of a sphereActa Crystallographica Section A Foundations of Crystallography, 1992
- Equilibrium configurations of N equal charges on a sphereJournal of Physics A: General Physics, 1991
- Stable configurations of confined cold ionic systems.Proceedings of the National Academy of Sciences, 1991
- Searching potential energy surfaces by simulated annealingNature, 1986
- Optimization by Simulated AnnealingScience, 1983
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953
- Unique Arrangements of Points on a SphereThe American Mathematical Monthly, 1952