Minimize the squared distance , which has the same minimizers as the distance. The Lagrange multiplier equations for the constraint are
The constraint gradient cannot vanish on this branch, since its second component is . Eliminate to obtain . Put ; then , so . But the constraint says , requiring and selecting . It follows that
To prove a global minimum on the whole branch, substitute into :
The arithmetic-geometric mean inequality proves this bound, with equality only when , namely . Thus the stationary point is the unique closest point on the required branch. Numerically it is approximately and its distance is in coordinate units.

Articles by others on the same topic (0)

There are currently no matching articles.