scientific article; zbMATH DE number 2065332

From MaRDI portal
Publication:4459964





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].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459964)