Second-variation methods in dynamic optimization
From MaRDI portal
Publication:2532029
DOI10.1007/BF00929441zbMath0172.13103MaRDI QIDQ2532029
Publication date: 1969
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (4)
A numerical study of low-thrust limited power trajectories between coplanar circular orbits in an inverse-square force field ⋮ Numerical and analytical study of optimal low-thrust limited-power transfers between close circular coplanar orbits ⋮ Recent advances in gradient algorithms for optimal control problems ⋮ Interplanetary patched-conic approximation with an intermediary swing-by maneuver with the Moon
Cites Work
- Unnamed Item
- Unnamed Item
- Comparison of several numerical optimization methods
- The successive sweep method and dynamic programming
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- Solution of variational problems by means of a generalized newton-raphson operator
- 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
This page was built for publication: Second-variation methods in dynamic optimization