A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
From MaRDI portal
Publication:1756799
DOI10.1007/S10898-018-0671-9zbMATH Open1422.90058arXiv1709.03062OpenAlexW2963183000WikidataQ110865156 ScholiaQ110865156MaRDI QIDQ1756799FDOQ1756799
Authors: W. Geremew, Nguyen Mau Nam, Alexander Semenov, Vladimir Boginski, Eduardo L. Pasiliao 
Publication date: 27 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: This paper continues our effort initiated in [9] to study Multicast Communication Networks, modeled as bilevel hierarchical clustering problems, by using mathematical optimization techniques. 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 through the network. The fact that the cluster centers and the total center have to be among the given nodes makes this problem a discrete optimization problem. Our approach is to reformulate the discrete problem as a continuous one and to apply Nesterov smoothing approximation technique 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.
Full work available at URL: https://arxiv.org/abs/1709.03062
Recommendations
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
- Solving a continuous multifacility location problem by DC algorithms
- DC programming and DCA for transmit beamforming and power allocation in multicasting relay network
- Optimal solution of the discrete cost multicommodity network design problem
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Smooth minimization of non-smooth functions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- An easy path to convex analysis and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Optimization based DC programming and DCA for hierarchical clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- Minimizing differences of convex functions with applications to facility location and clustering
Cited In (6)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- A DC optimization approach for constrained clustering with \(\ell_1\)-norm
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The boosted DC algorithm for linearly constrained DC programming
Uses Software
This page was built for publication: A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756799)
