A primal-dual algorithm for the fermat-weber problem involving mixed gauges
From MaRDI portal
Publication:3783052
DOI10.1007/BF02592080zbMath0641.90034MaRDI QIDQ3783052
O. Lefebvre, Christian Michelot
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
polyhedral gaugesFermat-Weber location problemproximal point algorithmmixed gaugespartial inverse method
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)
Related Items
A generalized Weber problem with different gauges for different regions ⋮ Duality results and proximal solutions of the Huber \(M\)-estimator problem ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ Single facility location problem with region-dependent distance metrics ⋮ Finite convergence of the partial inverse algorithm ⋮ A discretizing algorithm for location problems ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Accelerating the convergence in the single-source and multi-source Weber problems ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Gate points in continuous location between regions with different \(\ell _{p}\) norms ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line ⋮ An abstract symmetric framework for duality in mathematical programming ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ Duality for optimal control-approximation problems with gauges ⋮ A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity
Cites Work
- Unnamed Item
- Partial inverse of a monotone operator
- A primal-dual projection method for solving systems of linear inequalities
- Geometrical properties of the Fermat-Weber problem
- Sets of efficient points in a normed space
- The Weber problem revisited
- Theorems on the dimensions of convex sets
- A quadratically convergent method for minimizing a sum of euclidean norms
- Using Block Norms for Location Modeling
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Local convergence in Fermat's problem
- Monotone Operators and the Proximal Point Algorithm
- A primal simplex algorithm to solve a rectilinear distance facility location problem
- On the Fermat—Weber problem with convex cost functions
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Bounding methods for facilities location algorithms
- Technical Note—Location Theory: A Selective Bibliography
- A note on Fermat's problem
This page was built for publication: A primal-dual algorithm for the fermat-weber problem involving mixed gauges
