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.
No takes yet. Share an insight, caveat, or question.
Norman Zadeh (1970) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: