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

From MaRDI portal
Revision as of 21:36, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Hit-and-run algorithms for the identification of nonredundant linear inequalities
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references