Solving a Generalized Heron Problem by means of Convex Analysis

Details Solving a Generalized Heron Problem by means of Convex Analysis Solving a Generalized Heron Problem by means of Convex Analysis

2010-11-14

arxiv.org/abs/1011.3242v1

Mathematics

Optimization and Control

Scientific paper

The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or differential calculus. In the light of modern convex analysis, we are able to investigate more general versions of this problem. In this paper we propose and solve the following problem: on a given nonempty closed convex subset of $\R^s$, find a point such that the sum of the distances from that point to $n$ given nonempty closed convex subsets of $\R^s$ is minimal.

Affiliated with

Also associated with

No associations

Rating

Solving a Generalized Heron Problem by means of Convex Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving a Generalized Heron Problem by means of Convex Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving a Generalized Heron Problem by means of Convex Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-456375