A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique

DOI10.1007/s10898-018-0671-9zbMath1422.90058arXiv1709.03062OpenAlexW2963183000WikidataQ110865156 ScholiaQ110865156MaRDI QIDQ1756799

W. Geremew, Vladimir L. Boginski, Eduardo L. Pasiliao, Alexander Semenov, Nguyen Mau Nam

Publication date: 27 December 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.03062

zbMATH Keywords

hierarchical clusteringsubgradientDC programmingFenchel conjugateNesterov's smoothing techniques

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

The boosted DC algorithm for linearly constrained DC programming ⋮ Unnamed Item ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
• A new efficient algorithm based on DC programming and DCA for clustering
• Minimizing differences of convex functions with applications to facility location and clustering
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• Optimization based DC programming and DCA for hierarchical clustering
• TSPLIB—A Traveling Salesman Problem Library
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

This page was built for publication: A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique