knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. due to properly converting the task of optimization to an equivalent...

the extended trust region subproblem has been the focus of several research recently. under various assumptions, strong duality and certain socp/sdp relaxations have been proposed for several classes of it. due to its importance, in this paper, without any assumption on the problem, we apply the widely used alternating direction method of multipliers (admm) to solve it. the convergence of admm ...

0