Document Type

Pre-Print

Publication Date

3-2017

Abstract

A bilevel hierarchical clustering model is commonly used in designing optimal multicast networks. In this paper we will consider two different formulations of the bilevel hierarchical clustering problem -- a discrete optimization problem which can be shown to be NP-hard. Our approach is to reformulate the problem as a continuous optimization problem by making some relaxations on the discreteness conditions. This approach was considered by other researchers earlier, but their proposed methods depend on the square of the Euclidian norm because of its differentiability. By applying the Nesterov smoothing technique and the DCA -- a numerical algorithm for minimizing differences of convex functions -- we are able to cope with new formulations that involve the Euclidean norm instead of the squared Euclidean norm. Numerical examples are provided to illustrate our method.

Locate the Document

This article was originally published on arXiv.org and can be found here.

Persistent Identifier

http://archives.pdx.edu/ds/psu/19539

Included in

Mathematics Commons

Share

COinS