Markov decision processes for infinite horizon problems solved with the cosine simplex method (Q3165917): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2010.541456 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005910847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Program approach in multi-chain Markov Decision Processes revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical finite pivoting rules for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex-like method with bisection for linear programming<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5305630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised simplex algorithm for finite Markov decision processes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Markov decision processes for infinite horizon problems solved with the cosine simplex method
scientific article

    Statements

    Markov decision processes for infinite horizon problems solved with the cosine simplex method (English)
    0 references
    0 references
    19 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov decision processes
    0 references
    cosine simplex method
    0 references
    linear programming
    0 references
    Markov pivoting rule
    0 references
    0 references