This paper is devoted to the problems of
minimizing and maximizing a strongly convex
function over an arbitrary set. Based on
global optimality conditions for these
problems, we develop two algorithms MAX and
MIN for solving them. The proposed algoritms
are shown to be globally convergent.