The successive sweep method and dynamic programming
From MaRDI portal
Publication:2535478
DOI10.1016/0022-247X(67)90012-1zbMath0183.17102MaRDI QIDQ2535478
Publication date: 1967
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (9)
Computational and approximate methods of optimal control ⋮ A sweeping gradient method for ordinary differential equations with events ⋮ Optimal deterministic guidance for bounded-thrust spacecrafts ⋮ Convergence rate analysis of the state increment dynamic programming method ⋮ On optimal control problems with discontinuities ⋮ Second-variation methods in dynamic optimization ⋮ The use of a method of perturbations in the synthesis of closed-loop optimal control laws for non-linear systems ⋮ The successive sweep method and dynamic programming ⋮ New conditions for boundedness of the solution of a matrix Riccati differential equation
Cites Work
- Dynamic programming and the calculus of variations
- The numerical solution of variational problems
- The successive sweep method and dynamic programming
- Successive approximation methods for the solution of optimal control problems
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- On the Numerical Integration of Certain Differential Equations of the Second Order
- Optimal trajectories and linear control of nonlinear systems
- Optimization and Control of Nonlinear Systems Using the Second Variation
- An Algorithm for the Iterative Solution of a Class of Two-Point Boundary Value Problems
- On methods for obtaining solutions of fixed end-point problems in the calculus of variations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The successive sweep method and dynamic programming