TheoremBase

Nearest Points in a Nonempty Closed Convex Subset of Rn\mathbb{R}^n: Existence, Uniqueness and the Variational Inequality

Every point of RnR^n has exactly one nearest point in a nonempty closed convex set C, and a point p of C is nearest to x exactly when (x−p)·(y−p) ≤ 0 for all y in C.

Statement

In the setting of Separation in Rn\mathbb{R}^n: Standing Notation, let C⊆RnC\subseteq\mathbb{R}^{n} be nonempty, closed and convex, and let x∈Rnx\in\mathbb{R}^{n}.

Existence and uniqueness. There is exactly one p∈Cp\in C with

∥x−p∥≤∥x−y∥for every y∈C.\lVert x-p\rVert\le\lVert x-y\rVert\qquad\text{for every }y\in C.

Variational inequality. A point p∈Cp\in C satisfies ∥x−p∥≤∥x−y∥\lVert x-p\rVert\le\lVert x-y\rVert for every y∈Cy\in C if and only if

(x−p)⋅(y−p)≤0for every y∈C.(x-p)\cdot(y-p)\le0\qquad\text{for every }y\in C.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…