A mixed forward-backward dynamic programming method using parallel computation

DOI10.1007/BF00940821MaRDI QIDQ790721zbMATH OpenOpenAlexFDO

Authors Jean B. Lasserre

Publication date 1985

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00940821

zbMATH Keywords

computational accelerationparallel computation

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Numerical mathematical programming methods (65K05) Dynamic programming (90C39)

Review text

We consider optimization problems which can be solved by either forward or backward dynamic programming. We propose a method which reduces the computing time by a factor of two when two processors are used in parallel.

Recommendations

• scientific article; zbMATH DE number 3939121
• scientific article; zbMATH DE number 1835983
• scientific article; zbMATH DE number 17445
• An optimal sublinear time parallel algorithm for some dynamic programming problems
• scientific article; zbMATH DE number 3898635

Cites work

• The art and theory of dynamic programming

Cited in

(7)

• Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems
• scientific article; zbMATH DE number 3918123 (Why is no real title available?)
• scientific article; zbMATH DE number 3924127 (Why is no real title available?)
• scientific article; zbMATH DE number 3939121 (Why is no real title available?)
• scientific article; zbMATH DE number 1835983 (Why is no real title available?)
• scientific article; zbMATH DE number 853731 (Why is no real title available?)
• An improved backward algorithm on dynamic programming

This page was built for publication: A mixed forward-backward dynamic programming method using parallel computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790721)