论文信息 - A Heuristic Method for Finding Most Extrema of a Nonlinear Functional

A Heuristic Method for Finding Most Extrema of a Nonlinear Functional

A heuristic search is described which has the aim of finding practically all the extrema of a given nonlinear functional. A standard unimodal descent algorithm is employed for finding individual extrema. This basic algorithm is applied repeatedly using various computed initial points and starting directions. Through the additional use of several learning cycles most of the available extrema can be found. Numerical experiments indicate that the method is very efficient for the functionals of dimensions 15-20 with 20-25 extrema.

Jasna Opacic

[1] Robert Hooke,et al. `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[2] King-Sun Fu,et al. A variable structure automaton used as a multi-modal searching technique , 1965 .

[3] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[4] H. Bremermann. A method of unconstrained global optimization , 1970 .

[5] Samuel H. Brooks. A Discussion of Random Methods for Seeking Maxima , 1958 .

[6] V. K. Chichinadze. The Ψ-transform for solving linear and non-linear programming problems , 1969, Autom..

[7] J. Douglas Hill. A Search Technique for Multimodal Surfaces , 1969, IEEE Trans. Syst. Sci. Cybern..

[8] Ray A. Jarvis,et al. Adaptive Global Search in a Time-Variant Environment Using a Probabilistic Automaton with Pattern Recognition Supervision , 1970, IEEE Trans. Syst. Sci. Cybern..

[9] R. L. Barron. Inference of vehicle and atmosphere parameters from free-flight motions. , 1967 .