A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- 22 Downloads
This paper continues our recent effort in applying continuous optimization techniques to study optimal multicast communication networks modeled as bilevel hierarchical clustering problems. Given a finite number of nodes, we consider two different models of multicast networks by identifying a certain number of nodes as cluster centers, and at the same time, locating a particular node that serves as a total center so as to minimize the total transportation cost throughout the network. The fact that the cluster centers and the total center have to be among the given nodes makes these problems discrete optimization problems. Our approach is to reformulate the discrete problems as continuous ones and to apply Nesterov’s smoothing approximation techniques on the Minkowski gauges that are used as distance measures. This approach enables us to propose two implementable DCA-based algorithms for solving the problems. Numerical results and practical applications are provided to illustrate our approach.
KeywordsDC programming Nesterov’s smoothing techniques Hierarchical clustering Subgradient Fenchel conjugate
Mathematics Subject Classification49J52 49J53 90C31
This material is based upon work supported by the AFRL Mathematical Modeling and Optimization Institute. The authors are grateful to both anonymous referees for their helpful comments that allowed us to improve the original presentation.
- 5.Bagirov, A.: Derivative-free methods for unconstrained nonsmooth optimization and its numerical analysis. Investig. Oper. 19, 75–93 (1999)Google Scholar
- 6.Bagirov, A., Jia, L., Ouveysi, I., Rubinov, A.M.: Optimization based clustering algorithms in Multicast group hierarchies. In: Proceedings of the Australian Telecommunications, Networks and Applications Conference (ATNAC), Melbourne Australia (published on CD, ISNB 0-646-42229-4) (2003)Google Scholar
- 8.Barbosa, G. V., Villas-Boas, S. B., Xavier, A. E.: Solving the two-level clustering problem by hyperbolic smoothing approach, and design of multicast networks. In: Selected Proceedings, WCTR RIO (2013)Google Scholar