In Memoriam: Donald J. Newman (1930--2007)
Journal of Approximation Theory
Accuracy Certificates for Computational Problems with Convex Structure
Mathematics of Operations Research
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
SIAM Journal on Optimization
| Hi-index | 0.01 |
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.”