Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
From MaRDI portal
Publication:2383649
DOI10.1016/j.amc.2006.12.014zbMath1126.65055OpenAlexW2140350719MaRDI QIDQ2383649
Publication date: 19 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.12.014
algorithmsnumerical experimentsmerit functionsecond-order cone programmingsmoothing functionEuclidean \(\kappa \)-centrum problemlocation algorithms
Numerical mathematical programming methods (65K05) Convex programming (90C25) Continuous location (90B85)
Related Items
On solving the planar \(k\)-centrum problem with Euclidean distances, One-dimensional center-based l 1-clustering method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- Applications of second-order cone programming
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Second-order cone programming
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Minimizing the sum of the \(k\) largest functions in linear time.
- Conditional median: a parametric solution concept for location problems
- Interior point methods for second-order cone programming and OR applications
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Properties of thek-centra in a tree network
- Centers to centroids in graphs
- Numerical Optimization
- A special newton-type optimization method
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- A Limited Memory Algorithm for Bound Constrained Optimization
- Convex Analysis
- The \(k\)-centrum multi-facility location problem
