Second-variation methods in dynamic optimization
From MaRDI portal
Publication:2532029
Cites work
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- An Algorithm for the Iterative Solution of a Class of Two-Point Boundary Value Problems
- Comparison of several numerical optimization methods
- scientific article; zbMATH DE number 3150211 (Why is no real title available?)
- scientific article; zbMATH DE number 3273472 (Why is no real title available?)
- Optimization and Control of Nonlinear Systems Using the Second Variation
- Solution of variational problems by means of a generalized newton-raphson operator
- The successive sweep method and dynamic programming
Cited in
(4)- Recent advances in gradient algorithms for optimal control problems
- A numerical study of low-thrust limited power trajectories between coplanar circular orbits in an inverse-square force field
- Interplanetary patched-conic approximation with an intermediary swing-by maneuver with the Moon
- Numerical and analytical study of optimal low-thrust limited-power transfers between close circular coplanar orbits
This page was built for publication: Second-variation methods in dynamic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532029)