Pages that link to "Item:Q2884291"

The following pages link to The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate (Q2884291):

Displaying 49 items.

• Continue, quit, restart probability model (Q333092) (← links)
• On the number of solutions generated by the dual simplex method (Q439907) (← links)
• Policy iteration for robust nonstationary Markov decision processes (Q518127) (← links)
• The double pivot simplex method (Q684156) (← links)
• Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
• Efficient computation of a canonical form for a matrix with the generalized P-property (Q747763) (← links)
• Random search for constrained Markov decision processes with multi-policy improvement (Q895275) (← links)
• A polynomial time bound for Howard's policy improvement algorithm (Q1079511) (← links)
• Revised simplex algorithm for finite Markov decision processes (Q1321424) (← links)
• The value iteration algorithm is not strongly polynomial for discounted dynamic programming (Q1667204) (← links)
• Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
• Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
• A primal-simplex based Tardos' algorithm (Q1785451) (← links)
• Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
• Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
• The greedy strategy for optimizing the Perron eigenvalue (Q2133407) (← links)
• The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
• The operator approach to entropy games (Q2321934) (← links)
• A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
• Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems (Q2450614) (← links)
• Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
• Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
• Policy iteration based on stochastic factorization (Q2878742) (← links)
• On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
• On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
• A Strongly Polynomial Algorithm for Controlled Queues (Q3169077) (← links)
• Improved and Generalized Upper Bounds on the Complexity of Policy Iteration (Q3186525) (← links)
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
• The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (Q3465936) (← links)
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
• (Q4999027) (← links)
• Uniform Turnpike Theorems for Finite Markov Decision Processes (Q5108234) (← links)
• Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• Towards solving 2-TBSG efficiently (Q5135251) (← links)
• What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
• More bounds on the diameters of convex polytopes (Q5299904) (← links)
• Polynomial-Time Computation of Strong and <i>n</i>-Present-Value Optimal Policies in Markov Decision Chains (Q5359111) (← links)
• Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes (Q5862806) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
• Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes (Q6116235) (← links)
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
• Joint chance-constrained Markov decision processes (Q6160959) (← links)
• A practitioner's guide to MDP model checking algorithms (Q6535370) (← links)
• On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)
• Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity (Q6608040) (← links)
• Optimal control of linear cost networks (Q6652240) (← links)