The current paper proposes and tests algorithms for finding the diameter of a compact convex set and the farthest point in the set to another point. For these two nonconvex problems, I construct Frank-Wolfe and projected gradient ascent algorithms. Although th... ...
