Revisiting several problems and algorithms in Continuous Location with l_p norms
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Polynomial Optimisation
This work addresses the general continuous single facility location problems in finite dimension spaces under possibly diferent l_p norms, p>=1, in the demand points. We analyze the dificulty of this family of problems and revisit convergence properties of some wellknown algorithms. The ultimate goal is to provide a common approach to solve the family of continuous l_p ordered median location problems in dimension d (including of course the l_p minisum or FermatWeber location problem for any p>=1). We prove that this approach has a polynomial worst case complexity for monotone lambda weights and can be also applied to constrained and even nonconvex problems.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
