No label defined (Q4459964)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2065332
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2065332

      Statements

      0 references
      0 references
      0 references
      18 May 2004
      0 references
      Chebyshev center
      0 references
      polyhedrally constrained algorithm
      0 references
      For a finite set \(A\) in a real inner product space \(X\) and for \(x \in X\), let \(Z(A)\) denote the singleton, \[ Z(A) =\{x^\ast : \max \{\| a-x^\ast\| :a \in A\} \leq \max \{\| a-x\| :a \in A\}\}. \] For a convex set \(K\), let \(Z_K(A)=\{x^\ast: x^\ast \in Z(A)~\forall~ x \in K\}\). When \(K\) is a polyhedral convex set in \(\mathbb R^n\) of dimension \(\alpha \leq n\), the authors give a polyhedrally constrained algorithm that converges to \(Z_K(A)\). For the entire collection see [Zbl 1028.00020].
      0 references

      Identifiers