Location, pricing and the problem of Apollonius

We investigate via a conjugate duality approach general nonlinear minmax location problems formulated by means of an extended perturbed minimal time function, necessary and sufficient optimality conditions being delivered together with characterizations of the optimal solutions in some particular instances. A parallel splitting proximal point method is employed in order to numerically solve such problems and their duals. We present the computational results obtained in matlab on concrete examples, successfully comparing these, where possible, with earlier similar methods from the literature. Moreover, the dual employment of the proximal method turns out to deliver the optimal solution to the considered primal problem faster than the direct usage on the latter. Since our technique successfully solves location optimization problems with large data sets in high dimensions, we envision its future usage on big data problems arising in machine learning.Keywords Gauge (Minkowski) function · Minimal time function · Minmax multifacility location problem · Sylvester problem · Apollonius problem · Proximal point algorithm · Epigraphical projection · Projection operator · Machine learning 1 PreliminariesIn this paper we investigate nonlinear minmax location problems that are generalizations of the classical Sylvester problem in location theory-not to be confused with Sylvester's line

show abstract

“…where a i > 0 and p i ∈ R 2 , i = 1, 2, 3, then this problem is also known as the classical Apollonius problem (see [4,13,18]).…”

Section: Remark 310mentioning

confidence: 99%

“…the constraint n i=1 y * i = 0 R m must be fulfilled. For an economical interpretation of (P T ) we refer to [4].…”

Section: Remark 311mentioning

confidence: 99%