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.

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

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 ...

Looking for more on identifying features of a quadratic function? Check out our National 5 Maths guide. National 5 Maths identifying features of a quadratic function. revision-guideNational 5 Maths ...

Barycentric coordinates provide a robust framework for expressing any point within a simplex—typically a triangle or convex polygon—as an affine combination of its vertices. This representation has ...