Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
J. C. Dunn,
D. P. Bertsekas
Research output
:
Contribution to journal
›
Article
›
peer-review
65
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Dynamic Programming
82%
Newton Methods
78%
Discrete-time
66%
Optimal Control Problem
66%
Bolza Problem
61%
Costs
59%
Two-point Boundary Value Problem
41%
Substitution
38%
Continuous Time
35%
Vanish
35%
Optimal Solution
34%
Objective function
34%
Linearly
32%
Tend
30%
Computing
25%
Business & Economics
Optimal Control Problem
100%
Discrete-time
81%
Dynamic Programming
79%
Continuous Time
40%
Substitution
40%
Objective Function
37%
Optimal Solution
35%
Costs
31%
Engineering & Materials Science
Newton-Raphson method
90%
Dynamic programming
79%
Boundary value problems
45%
Nonlinear equations
44%
Substitution reactions
40%
Costs
31%