saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives a'/>
An Efficient Proximal Point Algorithm for Unweighted Max-Min Dispersion Problem*
In this paper, we first reformulate the max-min dispersion problem as a style="font-family:Verdana;"> saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
展开▼
