You are not currently logged in.
Access JSTOR through your library or other institution:
A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
Eric C. Chi and Kenneth Lange
The American Mathematical Monthly
Vol. 121, No. 2 (February 2014), pp. 95-108
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/10.4169/amer.math.monthly.121.02.095
Page Count: 14
Preview not available
Abstract In a recent issue of this Monthly, Mordukhovich, Nam, and Salinas pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem, we are given k + 1 closed convex sets in ℝd equipped with its Euclidean norm and asked to find the point in the last set such that the sum of the distances to the first k sets is minimal. In later work, the authors generalize the Heron problem even further, relax its convexity assumptions, study its theoretical properties, and pursue subgradient algorithms for solving the convex case. Here, we revisit the original problem solely from the numerical perspective. By exploiting the majorizationminimization (MM) principle of computational statistics and rudimentary techniques from differential calculus, we are able to construct a very fast algorithm for solving the Euclidean version of the generalized Heron problem.
Copyright the Mathematical Association of America 2014