Matrix inequalities and convex functions constitute a central theme in modern mathematical analysis, with far‐reaching implications across numerical analysis, optimisation, quantum information, and ...
SIAM Journal on Applied Mathematics, Vol. 27, No. 1 (Jul., 1974), pp. 131-137 (7 pages) A necessary condition and a sufficient condition for the pseudo-convexity of a function are given. These ...
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