Abstract
Many well known methods for seeking the extremum had been developed on the basis of quadratic approximation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J., Mockus. On a Bayesian method for seeking an extremum. Automatika i vychislitelnaja tekhnika, N 3, 1972.
J. Mockus. On the Bayesian methods of optimization. In “Minimization Algorithms and Dynamic Systems” ed. by G. Szego and L. Dixon. North-Holland Publ., Amsterdam (in print).
V. šaltenis. On a method of multiextremal optimization. Automatika i vychislitelnaja tekhnika, N 3, 1973.
A. Žilinskas and J. Mockus. On a Bayes method for seeking an extremum. Automatika i vychislitelnaja tekhnika, N 3, 1972.
L.A. Rastrigin. The stochastic methods of search. Nauka, Moscow, 1968.
A. Žilinskas. One-stage Bayesian method for unidimensional search. Preprint N 663–74. VINITI, Moscow, 1974.
L. Telksnys and V. Šaltenis. The application of multiextremal methods to the problem of estimation of parameters of random signals. Proc. 5th Conf. on extremal problems. Gorkij (in print).
A. Ališauskas, A. Lipskis, A. MaSiulis, V. Šaltenis. The application of multiextremal optimization to the planning of experiments for the development of high temperature — resistant polymeric compositions. Proc. 9th Seminar on the stochastic search. Kharkov (in print).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Močkus, J. (1975). On Bayesian Methods for Seeking the Extremum. In: Marchuk, G.I. (eds) Optimization Techniques IFIP Technical Conference. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-38527-2_55
Download citation
DOI: https://doi.org/10.1007/978-3-662-38527-2_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-37713-0
Online ISBN: 978-3-662-38527-2
eBook Packages: Springer Book Archive