Thumbnail
Access Restriction
Subscribed

Author Newman, D. J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1965
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Pinning down the maximum of a function in one or more variable is a basic computing problem. Without further a priori information regarding the nature of the function, of course, the problem is not feasible for computation. Thus if the function is permitted to oscillate infinitely often then no number of evaluations can give information regarding its maximum.J. Kiefer, in his paper, treats the one-dimensional problem and shows that the correct a priori assumption regarding the function is that of “unimodality.” He then gives the complete and exact optimal procedure within this framework.In this paper is given what the author believes is the correct a priori background for functions of several variables. (This is analogous to unimodality in one dimension.) However, there is not obtained the exactness of Kiefer's result, but rather the determination of the correct procedures to within “order of magnitude.”
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1965-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 12
Issue Number 3
Page Count 4
Starting Page 395
Ending Page 398


Open content in new tab

   Open content in new tab
Source: ACM Digital Library