Inner search methods for linear programming
A conception of optimality for algorithms and its application to the optimal search for a minimum
Optimal algorithms for seeking the minimum
The definition of the optimality of an algorithm is modified so that the optimal algorithm satisfies Bellman's principle. The search for a minimum using this technique is compared with J. Kiefer's algorithm
Page 1