Convex duality and the Skorokhod problem. II (Q1963836)
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 1398349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex duality and the Skorokhod problem. II |
scientific article; zbMATH DE number 1398349 |
Statements
Convex duality and the Skorokhod problem. II (English)
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
0.8600165247917175
0 references
0.8600165247917175
0 references
0.7716969847679138
0 references
0.7352274060249329
0 references
0.7345572113990784
0 references
