Solving k-center problems involving sets based on optimization techniques
From MaRDI portal
Publication:2301186
The authors study the following generalized version of the \(k\)-center problem from both theoretical and numerical viewpoints: Given a finite number of nonempty closed convex sets in \(\mathbb{R}^n\), find \(k\) balls with the smallest radius such that their union intersects all of the sets. They particularly develop a numerical algorithms for solving them using a heuristic method and a new method based on the DCA, an algorithm for minimizing differences of convex functions. The effectiveness of these algorithms is proved via numerical examples at the end of the paper.
Recommendations
- On the k-center problem with many centers
- Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets
- \(k\)-center problems with minimum coverage
- Computing and Combinatorics
- A Best Possible Heuristic for the k-Center Problem
- The Capacitated K-Center Problem
- The capacitated K-center problem (extended abstract)
- Approximation algorithms for the k-center problem: an experimental evaluation
- The p-Centre Problem-Heuristic and Optimal Algorithms
- The k-centrum multi-facility location problem
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A generalized Sylvester problem and a generalized Fermat-Torricelli problem
- A generalized Weiszfeld method for the multi-facility location problem
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- An Approach to Location Models Involving Sets as Existing Facilities
- An easy path to convex analysis and applications
- Applications of convex analysis to the smallest intersecting ball problem
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- 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 (Weighted) Minimum Circle Problem
- Efficient algorithms for the smallest enclosing ball problem
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- Locating facilities by minimax relative to closest points of demand areas
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Minimax and maximin facility location problems on a sphere
- Minimizing differences of convex functions with applications to facility location and clustering
- Minsum location extended to gauges and to convex sets
- On the geometry of the smallest circle enclosing a finite set of points
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- On the smallest enclosing balls
- On the structure of the solution set for the single facility location problem with average distances
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Smooth minimization of non-smooth functions
- Spherical minimax location problem
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- Two Algorithms for the Minimum Enclosing Ball Problem
Cited in
(31)- On the k-center problem with many centers
- Self-adaptive inertial extragradient algorithms for solving variational inequality problems
- 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
- Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
- Stability and convergence analysis for set-valued extended generalized nonlinear mixed variational inequality problems and generalized resolvent dynamical systems
- Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings
- Self-adaptive iterative algorithms for the split common fixed point problem with demicontractive operators
- Convergence analysis of an inertial Tseng's extragradient algorithm for solving pseudomonotone variational inequalities and applications
- A Best Possible Heuristic for the k-Center Problem
- Computing and Combinatorics
- A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
- 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
- An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems
- New Algorithms for k-Center and Extensions
- Variational inequalities, variational inclusions and common fixed point problems in Banach spaces
- A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces
- A new class of inertial algorithms with monotonic step sizes for solving fixed point and variational inequalities
- Accelerated strongly convergent extragradient algorithms to solve variational inequalities and fixed point problems in real Hilbert spaces
- An algorithm for finding the generalized Chebyshev center of sets defined via their support functions
- Inertial viscosity Mann-type subgradient extragradient algorithms for solving variational inequality and fixed point problems in real Hilbert spaces
- A novel method for solving split variational inequality and fixed point problems
- A double inertial parallel Mann algorithm for finite nonexpansive mappings in blind image restoration
- Qualitative properties of k-center problems
- Dual-inertial viscosity-based subgradient extragradient methods for equilibrium problems over fixed point sets
- Strong convergence of dual inertial fixed point algorithms for computing fixed points over the solution set of a variational inequality problem in real Hilbert spaces
- The variable metric three-operator algorithms for solving monotone inclusions
This page was built for publication: Solving \(k\)-center problems involving sets based on optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301186)
