This is a preview. Log in through your library . Abstract Let f be a positive real-valued function defined on an interval I ⊆ R. The function f is said to be log-convex if logf is convex on I. In this ...
The problem is considered of maximizing a function in a convex region. To solve this problem a new method is developed, to be called "method of feasible directions". It is a method of steep ascent.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback