Time discretization and quantization methods for optimal multiple switching problem (Q424519): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65N50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93E20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6040312 / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal switching
Property / zbMATH Keywords: optimal switching / rank
 
Normal rank
Property / zbMATH Keywords
 
quantization of random variables
Property / zbMATH Keywords: quantization of random variables / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete-time approximation
Property / zbMATH Keywords: discrete-time approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov chains
Property / zbMATH Keywords: Markov chains / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical probability
Property / zbMATH Keywords: numerical probability / rank
 
Normal rank

Revision as of 22:27, 29 June 2023

scientific article
Language Label Description Also known as
English
Time discretization and quantization methods for optimal multiple switching problem
scientific article

    Statements

    Time discretization and quantization methods for optimal multiple switching problem (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    optimal switching
    0 references
    quantization of random variables
    0 references
    discrete-time approximation
    0 references
    Markov chains
    0 references
    numerical probability
    0 references