Key points are not available for this paper at this time.
The cyclic coordinate ascent method is a frequently used algorithm in optimization problems. It requires no derivatives and indicates in one iteration if a given point is optimal. It is proved that the cyclic coordinate ascent method will converge for pseudo concave functions, as well as for strictly concave functions as was previously known.
Norman Zadeh (Fri,) studied this question.