Optimization Online


Global optimization on the torus, the sphere and the rotation group

Manuel Gräf(manuel.graef***at***univie.ac.at)
Ralf Hielscher(Ralf.Hielscher***at***mathematik.tu-chemnitz.de)

Abstract: Detecting all local extrema or the global extremum of a polynomial on the torus, the sphere or the rotation group is a tough yet often requested numerical problem. We present a heuristic approach that applies common descent methods like nonlinear conjugated gradients or Newtons methods simultaneously to a large number of starting points. The corner stone of our approach are FFT like algorithms, i.e., algorithms that scale almost linearly with respect to the sum of the dimension of the polynomial space and the number of evaluation points. These FFT like algorithms allow us to compute one step of a descent method simultaneously for all staring points at almost the same cost as for one single starting point. The effectiveness of the proposed algorithms is demonstrated in various applications. In particular, we apply it to the Radon transform of a spherical function which allows us to detect lines in spherical patterns.

Keywords: global optimization on manifolds, iterative methods, harmonic analysis, fast Fourier methods, Kikuchy pattern, crystallographic texture analysis

Category 1: Global Optimization

Citation: Preprint 2014-1, department of mathematics, TU Chemnitz, Germany, 2014

Download: [PDF]

Entry Submitted: 02/04/2014
Entry Accepted: 02/04/2014
Entry Last Modified: 02/04/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society