A New Value Iteration Method for the Average Cost Dynamic Programming Problem

SIAM Journal on Control and Optimization- United States

doi 10.1137/s0363012995291609

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem With Customer Choice Behavior

Production and Operations Management
IndustrialManufacturing EngineeringManagement ScienceInnovationManagement of TechnologyOperations Research
2010English

A Nonlinear Programming Method for Dynamic Programming

Macroeconomic Dynamics
EconomicsEconometrics
2016English

A Proposed New Average Method for Solving Multi-Objective Linear Programming Problem Using Various Kinds of Mean Techniques

Mathematics Letters
2018English

Illustrated Review of Convergence Conditions of the Value Iteration Algorithm and the Rolling Horizon Procedure for Average-Cost MDPs

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2012English

Model-Free Value Iteration Solution for Dynamic Graphical Games

2018English

SUCCESSIVE ITERATION AND POSITIVE SOLUTIONS FOR a P-Laplacian MULTIPOINT BOUNDARY VALUE PROBLEM

ANZIAM Journal
Mathematics
2008English

Fixed Points by a New Iteration Method

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1974English

A New Second-Order Iteration Method for Solving Nonlinear Equations

Abstract and Applied Analysis
Applied MathematicsAnalysis
2013English

Inner Approximation Method for a Reverse Convex Programming Problem

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy