eduzhai > Physical Sciences > Physics Sciences >

An Efficient Random Algorithm for Box Constrained Weighted Maximin Dispersion Problem

  • Save

... pages left unread,continue reading

Document pages: 7 pages

Abstract: The box-constrained weighted maximin dispersionproblem is to find a point in an n-dimensional box such that the minimum of theweighted Euclidean distance from given m points is maximized. In this paper, we first reformulate the maximin dispersion problem as a non-convex quadratically constrainedquadratic programming (QCQP) problem. We adopt the successive convex approximation (SCA) algorithm to solve theproblem. Numerical results show that the proposed algorithm is efficient.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×