Solving \(k\)-center problems involving sets based on optimization techniques

DOI10.1007/s10898-019-00834-6zbMath1439.49026OpenAlexW2981560836WikidataQ126989882 ScholiaQ126989882MaRDI QIDQ2301186

Nguyen Thai An, Xiaolong Qin, Nguyen Mau Nam

Publication date: 28 February 2020

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

Full work available at URL: https://doi.org/10.1007/s10898-019-00834-6

zbMATH Keywords

difference of convex functionsmultifacility location problem\(k\)-center problemmajorization-minimization principle

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items

Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems, A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space, Stability and convergence analysis for set-valued extended generalized nonlinear mixed variational inequality problems and generalized resolvent dynamical systems, A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces, A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems, A new class of inertial algorithms with monotonic step sizes for solving fixed point and variational inequalities, Unnamed Item, Unnamed Item, Convergence rate analysis of proximal gradient methods with applications to composite minimization problems, Two Inertial extragradient viscosity algorithms for solving variational inequality and fixed point problems, Self-adaptive inertial extragradient algorithms for solving variational inequality problems, Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings, Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems, Composite extragradient implicit rule for solving a hierarchical variational inequality with constraints of variational inclusion and fixed point problems, Improved inertial projection and contraction method for solving pseudomonotone variational inequality problems, Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications, Unnamed Item, Variational inequalities, variational inclusions and common fixed point problems in Banach spaces

Uses Software

• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• Minsum location extended to gauges and to convex sets
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• On the structure of the solution set for the single facility location problem with average distances
• On the smallest enclosing balls
• A generalized Weiszfeld method for the multi-facility location problem
• Clustering to minimize the maximum intercluster distance
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• Efficient algorithms for the smallest enclosing ball problem
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• On the geometry of the smallest circle enclosing a finite set of points
• Minimizing differences of convex functions with applications to facility location and clustering
• A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
• Applications of Convex Analysis to the Smallest Intersecting Ball Problem
• Minimax and maximin facility location problems on a sphere
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Two Algorithms for the Minimum Enclosing Ball Problem
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• An Approach to Location Models Involving Sets as Existing Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• On the Minimum Volume Covering Ellipsoid of Ellipsoids
• Spherical minimax location problem
• Locating facilities by minimax relative to closest points of demand areas