Hi, I hope someone can help me out with this problem:(adsbygoogle = window.adsbygoogle || []).push({});

Let set S be defined by (x in En :f(x) <=c}

f: En -> E1 is convex and differentiable and gradient of f(xo) is not 0 when f(x) = c. Let xo be a point such that f(xo) = c and let d = gradient at xo. Let lamda be any positive number and define x1 = xo+ lamda(d)

we know:

||x1-xo|| <= ||x1-x||

suppse we have 2 islands:

f(x,y) <= c1 and g(x,y) <= c2

where f and g are contibuously differentiable and strictly convex functions whose gradient vectors are non zero when f(x,y) = c1 and g(x,y)=c2

We need to build a bridge between the two islands of shortest possible length. Using the result of the theorem of separating hyperplane, devise a search technique to find the optimal bridge location.

Test your routine on:

f(x,y)= x^2 +2y^2, c1=1

g(x,y)= (x-4)^2 + (y-3)^2, c2 = 1

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Shortest Distance between 2 convex sets

Loading...

Similar Threads for Shortest Distance between |
---|

I The difference between a family of sets and an indexed family of sets |

I Poisson distribution regarding expected distance |

**Physics Forums | Science Articles, Homework Help, Discussion**