A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144)

From MaRDI portal
Revision as of 09:59, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
scientific article

    Statements

    A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (English)
    0 references
    0 references
    0 references
    6 December 1993
    0 references
    fixed dimension optimization
    0 references
    Clarkson's randomized algorithm
    0 references
    interior point method
    0 references

    Identifiers

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