Electronic Resource
Springer
Journal of optimization theory and applications
22 (1977), S. 389-397
ISSN:
1573-2878
Keywords:
Calculus of variations
;
dynamic programming
;
reduction of dimensionality
;
two-stage algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A technique for finding the solution of discrete, multistate dynamic programming problems is applied to solve certain variational problems. The algorithm is a method of successive approximations using a general two-stage solution. The advantage of the method is that it provides a means of reducing Bellman's “curse of dimensionality.” An example on the Plateau problem or the minimal surface area problem is considered, and the algorithm is found to be computationally efficient.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00932862
Permalink
|
Location |
Call Number |
Expected |
Availability |