Convex duality and the Skorokhod problem. II (Q1963836)

From MaRDI portal
Revision as of 20:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Convex duality and the Skorokhod problem. II
scientific article

    Statements

    Convex duality and the Skorokhod problem. II (English)
    0 references
    0 references
    0 references
    13 September 2000
    0 references
    A number of applications is presented to show how it is working the method developed in the first part of this paper (reviewed above). The method is based on using convex duality in the case of the domain being a convex polyhedron. Among the models described there is a class of Skorokhod problems which arise from a model of processor sharing in communication networks.
    0 references
    Skorokhod problem
    0 references
    constrained deterministic and stochastic processes
    0 references
    convex polyhedron
    0 references
    convex duality
    0 references
    Lipschitz continuity
    0 references

    Identifiers

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