Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bellman_equation> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Bellman_equation abstract "A Bellman equation, also known as a dynamic programming equation, named after its discoverer, Richard Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the value of a decision problem at a certain point in time in terms of the payoff from some initial choices and the value of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into simpler subproblems, as Bellman's Principle of Optimality prescribes.The Bellman equation was first applied to engineering control theory and to other topics in applied mathematics, and subsequently became an important tool in economic theory.Almost any problem which can be solved using optimal control theory can also be solved by analyzing the appropriate Bellman equation. However, the term 'Bellman equation' usually refers to the dynamic programming equation associated with discrete-time optimization problems. In continuous-time optimization problems, the analogous equation is a partial differential equation which is usually called the Hamilton–Jacobi–Bellman equation.".
- Bellman_equation wikiPageID "1236458".
- Bellman_equation wikiPageRevisionID "600119584".
- Bellman_equation hasPhotoCollection Bellman_equation.
- Bellman_equation subject Category:Control_theory.
- Bellman_equation subject Category:Dynamic_programming.
- Bellman_equation subject Category:Equations.
- Bellman_equation subject Category:Mathematical_optimization.
- Bellman_equation type Abstraction100002137.
- Bellman_equation type Communication100033020.
- Bellman_equation type Equation106669864.
- Bellman_equation type Equations.
- Bellman_equation type MathematicalStatement106732169.
- Bellman_equation type Message106598915.
- Bellman_equation type Statement106722453.
- Bellman_equation comment "A Bellman equation, also known as a dynamic programming equation, named after its discoverer, Richard Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the value of a decision problem at a certain point in time in terms of the payoff from some initial choices and the value of the remaining decision problem that results from those initial choices.".
- Bellman_equation label "Bellman equation".
- Bellman_equation label "Ecuación de Bellman".
- Bellman_equation label "Optimalitätsprinzip von Bellman".
- Bellman_equation label "Уравнение Беллмана".
- Bellman_equation label "貝爾曼方程".
- Bellman_equation sameAs Optimalitätsprinzip_von_Bellman.
- Bellman_equation sameAs Ecuación_de_Bellman.
- Bellman_equation sameAs m.04k_pc.
- Bellman_equation sameAs Q1430750.
- Bellman_equation sameAs Q1430750.
- Bellman_equation sameAs Bellman_equation.
- Bellman_equation wasDerivedFrom Bellman_equation?oldid=600119584.
- Bellman_equation isPrimaryTopicOf Bellman_equation.