Two unconstrained optimization approaches for the Euclidean -centrum location problem
Given a positive integer \(k\), \(1\leq k\leq m\), the single facility Euclidean \(k\)-center problem in \(\mathbb R^n\) consists in locating a new facility so as to minimize the sum of the \(k\) largest weighted Euclidean distances to the existing \(m\) facilities. If \(a_i\in\mathbb R^n\) represents the position of the \(i\)-th existing facility, then \[ f_i(x)=\omega_i((x_1-a_{i1})^2+\cdots+ (x_n-a_{in})^2)^{1/2} \] is the weighted Euclidean distance between a new facility and the \(i\)-th existing facility \((\omega_i>0\) is the associated weight). Two efficient algorithms for solving this problem are proposed. The first one is based on the neural networks smooth approximation of the objective function and on reducing the problem to an unconstrained smooth convex minimization problem. The second one in based on the Fischer-Burmeister merit function. The Karush-Kuhn-Tucker system is transformed into an equivalent unconstraint smooth minimization problem. This problem is then solved using an appropriate minimization method. Both methods are reported to be extremely efficient, the first algorithm is able to solve problems for \(n\) up to 10000. Numerical experiments in the concluding part of the paper demonstrate the efficiency of the proposed algorithms.
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A smoothing Newton method for minimizing a sum of Euclidean norms
- A special newton-type optimization method
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- Applications of second-order cone programming
- Centers to centroids in graphs
- Conditional median: a parametric solution concept for location problems
- Convex Analysis
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- Interior point methods for second-order cone programming and OR applications
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- Minimizing the sum of the \(k\) largest functions in linear time.
- Numerical Optimization
- Properties of thek-centra in a tree network
- Second-order cone programming
- Smoothing functions for second-order-cone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- The k-centrum multi-facility location problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This page was built for publication: Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383649)
