A Heuristic Method for Finding Most Extrema of a Nonlinear Functional
- 1 January 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-3 (1) , 102-107
- https://doi.org/10.1109/tsmc.1973.5408584
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Adaptive Global Search in a Time-Variant Environment Using a Probabilistic Automaton with Pattern Recognition SupervisionIEEE Transactions on Systems Science and Cybernetics, 1970
- A method of unconstrained global optimizationMathematical Biosciences, 1970
- Inference of vehicle and atmosphere parameters from free-flight motions.Journal of Spacecraft and Rockets, 1969
- The Ψ-transform for solving linear and non-linear programming problemsAutomatica, 1969
- A Search Technique for Multimodal SurfacesIEEE Transactions on Systems Science and Cybernetics, 1969
- A variable structure automaton used as a multimodal searching techniqueIEEE Transactions on Automatic Control, 1966
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961
- A Discussion of Random Methods for Seeking MaximaOperations Research, 1958