A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
نویسندگان
چکیده
منابع مشابه
A modified Weiszfeld algorithm for the Fermat-Weber location problem
This paper gives a new, simple, monotonically convergent, algorithm for the Fermat-Weber location problem, with extensions covering more general cost functions.
متن کاملThe inverse Fermat-Weber problem
Given n points in the plane with nonnegative weights, the inverse Fermat-Weber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1-median. The cost is proportional to the increase or decrease of the corresponding weight. In case that the prespecified point does not coincide with one of the given n points, the inverse Ferma...
متن کاملStudy of a primal-dual algorithm for equality constrained minimization
The paper proposes a primal-dual algorithm for solving an equality constrained minimization problem. The algorithm is a Newton-like method applied to a sequence of perturbed optimality systems that follow naturally from the quadratic penalty approach. This work is first motivated by the fact that a primaldual formulation of the quadratic penalty provides a better framework than the standard pri...
متن کاملPrimal-dual algorithms for audio decomposition using mixed norms
We consider the problem of decomposing audio into components that have different time frequency characteristics. For this, we model the components using different transforms and mixed norms. While recent works concentrate on the synthesis prior formulation, we consider both the analysis and synthesis prior formulations. We derive algorithms for both formulations through a primal-dual framework....
متن کاملA Primal Dual Algorithm for a Heterogeneous Traveling Salesman Problem
Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. We consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each veh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1988
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1988220403131