Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations (Q4293291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adaptive aggregation methods for infinite horizon dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic optimal control. The discrete time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Approximations in Optimal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational methods in optimization. A unified approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular Stochastic Control Problems Solved by a Sparse Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems / rank
 
Normal rank

Latest revision as of 15:16, 22 May 2024

scientific article; zbMATH DE number 575677
Language Label Description Also known as
English
Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
scientific article; zbMATH DE number 575677

    Statements

    Identifiers

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