Displaying similar documents to “Fast projection method for a special class of polytopes with applications”

Marginalization like a projection.

Juan Francisco Verdegay-López, Serafín Moral (2001)

Mathware and Soft Computing

Similarity:

This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.

Detection of influential points by convex hull volume minimization

Petr Tichavský, Pavel Boček (1998)

Kybernetika

Similarity:

A method of geometrical characterization of multidimensional data sets, including construction of the convex hull of the data and calculation of the volume of the convex hull, is described. This technique, together with the concept of minimum convex hull volume, can be used for detection of influential points or outliers in multiple linear regression. An approximation to the true concept is achieved by ordering the data into a linear sequence such that the volume of the convex hull of...

Closures of faces of compact convex sets

A. K. Roy (1975)

Annales de l'institut Fourier

Similarity:

This paper gives necessary and sufficient conditions for the closure of a face in a compact convex set to be again a face. As applications of these results, several theorems scattered in the literature are proved in an economical and uniform manner.