Lipschitz continuous dynamic programming with discount

DOI10.1016/J.NA.2005.03.100zbMath1090.90192OpenAlexW4243706127MaRDI QIDQ2488263

Manuel Morán, José M. Maroto

Publication date: 25 August 2005

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2005.03.100

zbMATH Keywords

Dynamic programmingOptimizationRenewable resourcesOptimal growthNon-smoothness

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (2)

Lipschitz continuous dynamic programming with discount II ⋮ Generalized envelope theorems: applications to dynamic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete characterization of optimal growth paths in an aggregated model with a non-concave production function
• Lipschitz continuous policy functions for strongly concave optimization problems
• Intertemporal allocation with a non-convex technology: The aggregative framework
• On optimal cycles in dynamic programming models with convex return function
• Properties of the Bellman function in time-optimal control problems
• On the economically optimal exploitation of a renewable resource: The case of a convex environment and a convex return function
• Dynamic programming in economics.
• Optimization and chaos.
• Economically optimal policies for the utilization of biologically renewable resources
• Convergence of discretization procedures in dynamic programming
• Optimal investments with convex–concave revenue: a focus‐node distinction
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations

This page was built for publication: Lipschitz continuous dynamic programming with discount