[ojAlgo-user] Problem resolvable with ojAlgo?

[<kr...@Ma...>]

Hello list members,

i'd like to know whether this minimization problem is resolvable with
ojAlgo. I don't know at all how to get started with it.

I have a set of points P in 3d-space and a special point Q which is a
reference point for the minimization problem: The goal is to find a
hyperplane H so that the sum of distances from H to all points in P is
minimal. Constraint: For every p element of P distance(p, Q) must be <=
distance(H, Q).
To illustrate the problem I plotted an example in 2d-space:
http://www.savyon.de/share/minimization.png


Many thanks in advance,

Timo