N segments in 3d space are given. Segment is represented by 2 points. The problem is to find the point with minimal possible sum of distances to all segments.

CodePudding user response：

Let the segments be p₁ q₁, …, p_n q_n. We formulate an optimization problem:

minimize ∑_i ‖x − ((1 − y_i) p_i y_i q_i)‖
subject to
x ∈