Harman Patil (Editor)

Chebyshev center

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In geometry, the Chebyshev center of a bounded set Q having non-empty interior is the center of the minimal-radius ball enclosing the entire set Q , or alternatively (and non-equivalently) the center of largest inscribed ball of Q .

Contents

In the field of parameter estimation, the Chebyshev center approach tries to find an estimator x ^ for x given the feasibility set Q , such that x ^ minimizes the worst possible estimation error for x (e.g. best worst case).

Mathematical representation

There exist several alternative representations for the Chebyshev center. Consider the set Q and denote its Chebyshev center by x ^ . x ^ can be computed by solving:

min x ^ , r { r : ∥ x ^ − x ∥ 2 ≤ r , ∀ x ∈ Q }

or alternatively by solving:

* ⁡ arg ⁡ min x ^ max x ∈ Q ∥ x − x ^ ∥ 2 .

Despite these properties, finding the Chebyshev center may be a hard numerical optimization problem. For example, in the second representation above, the inner maximization is non-convex if the set Q is not convex.

Properties

In inner product spaces and two-dimensional spaces, if Q is closed, bounded and convex, then the Chebyshev center is in Q . In other words, the search for the Chebyshev center can be conducted inside Q without loss of generality.

In other spaces, the Chebyshev center may not be in Q , even if Q is convex. For instance, if Q is the tetrahedron formed by the convex hull of the points (1,1,1), (-1,1,1), (1,-1,1) and (1,1,-1), then computing the Chebyshev center using the ℓ ∞ norm yields

0 = arg ⁡ min x ^ ⁡ max x ∈ Q ∥ x − x ^ ∥ ∞ 2 .

Relaxed Chebyshev center

Let us consider the case in which the set Q can be represented as the intersection of k ellipsoids.

min x ^ max x { ∥ x ^ − x ∥ 2 : f i ( x ) ≤ 0 , 0 ≤ i ≤ k }

with

f i ( x ) = x T Q i x + 2 g i T x + d i ≤ 0 , 0 ≤ i ≤ k .

By introducing an additional matrix variable Δ = x x T , we can write the inner maximization problem of the Chebyshev center as:

min x ^ max ( Δ , x ) ∈ G { ∥ x ^ ∥ 2 − 2 x ^ T x + Tr ⁡ ( Δ ) }

where Tr ⁡ ( ⋅ ) is the trace operator and

G = { ( Δ , x ) : f i ( Δ , x ) ≤ 0 , 0 ≤ i ≤ k , Δ = x x T } f i ( Δ , x ) = Tr ⁡ ( Q i Δ ) + 2 g i T x + d i .

Relaxing our demand on Δ by demanding Δ ≥ x x T , i.e. Δ − x x T ∈ S + where S + is the set of positive semi-definite matrices, and changing the order of the min max to max min (see the references for more details), the optimization problem can be formulated as:

R C C = max ( Δ , x ) ∈ T { − ∥ x ∥ 2 + Tr ⁡ ( Δ ) }

with

T = { ( Δ , x ) : f i ( Δ , x ) ≤ 0 , 0 ≤ i ≤ k , Δ ≥ x x T } .

This last convex optimization problem is known as the relaxed Chebyshev center (RCC). The RCC has the following important properties:

  • The RCC is an upper bound for the exact Chebyshev center.
  • The RCC is unique.
  • The RCC is feasible.

    • Constrained least squares

    It can be shown that the well-known constrained least squares (CLS) problem is a relaxed version of the Chebyshev center.

    The original CLS problem can be formulated as:

    x ^ C L S = * ⁡ arg ⁡ min x ∈ C ∥ y − A x ∥ 2

    with

    C = { x : f i ( x ) = x T Q i x + 2 g i T x + d i ≤ 0 , 1 ≤ i ≤ k } Q i ≥ 0 , g i ∈ R m , d i ∈ R .

    It can be shown that this problem is equivalent to the following optimization problem:

    max ( Δ , x ) ∈ V { − ∥ x ∥ 2 + Tr ⁡ ( Δ ) }

    with

    V = { ( Δ , x ) : x ∈ C Tr ⁡ ( A T A Δ ) − 2 y T A T x + ∥ y ∥ 2 − ρ ≤ 0 , Δ ≥ x x T } .

    One can see that this problem is a relaxation of the Chebyshev center (though different than the RCC described above).

    RCC vs. CLS

    A solution set ( x , Δ ) for the RCC is also a solution for the CLS, and thus T ∈ V . This means that the CLS estimate is the solution of a looser relaxation than that of the RCC. Hence the CLS is an upper bound for the RCC, which is an upper bound for the real Chebyshev center.

    Modeling constraints

    Since both the RCC and CLS are based upon relaxation of the real feasibility set Q , the form in which Q is defined affects its relaxed versions. This of course affects the quality of the RCC and CLS estimators. As a simple example consider the linear box constraints:

    l ≤ a T x ≤ u

    which can alternatively be written as

    ( a T x − l ) ( a T x − u ) ≤ 0.

    It turns out that the first representation results with an upper bound estimator for the second one, hence using it may dramatically decrease the quality of the calculated estimator.

    This simple example shows us that great care should be given to the formulation of constraints when relaxation of the feasibility region is used.

    Linear programming problem

    This problem can be formulated as a linear programming problem, provided that the region Q is an intersection of finitely many hyperplanes.

    References

    Chebyshev center Wikipedia
    (Text) CC BY-SA