Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62047364, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
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.1016/j.ijar.2011.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152240460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of diffusion processes with reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markovian Decision Processes with Uncertain Transition Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Decision Processes with Imprecise Transition Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical models for imprecise probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming and Sequential Decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polynomial approximations in Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical decision theory and Bayesian analysis. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Control of Markov Decision Processes with Uncertain Transition Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-parameter Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Credal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact-restoration method for nonlinear bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steepest descent direction for the nonlinear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in multilinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric approximate linear programming for factored MDPs with application to constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete time Markov chains with interval probabilities / rank
 
Normal rank

Latest revision as of 16:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
scientific article

    Statements

    Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (English)
    0 references
    0 references
    0 references
    22 November 2011
    0 references
    0 references
    imprecise Markov decision processes (MDPIPs)
    0 references
    probabilistic planning
    0 references
    multilinear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references