Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740)

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 4014441
Language Label Description Also known as
default for all languages
No label defined
    English
    Hit-and-run algorithms for the identification of nonredundant linear inequalities
    scientific article; zbMATH DE number 4014441

      Statements

      Hit-and-run algorithms for the identification of nonredundant linear inequalities (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      1987
      0 references
      hit-and-run algorithms
      0 references
      uniform interior points
      0 references
      probabilistic algorithms
      0 references
      eliminating redundant inequalites
      0 references
      system of linear inequalities
      0 references
      hypersphere directions algorithm
      0 references
      coordinate directions
      0 references
      Bayesian stopping rule
      0 references
      Computational experiences
      0 references
      Two probabilistic algorithms are proposed for eliminating redundant inequalites from a system of linear inequalities. Both, the hypersphere directions algorithm and the coordinate directions algorithm, generate sequences of interior points whose limiting distributions are uniform. The algorithms are terminated through the use of a Bayesian stopping rule. Computational experiences are reported.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references