An efficient trust region method for unconstrained discrete-time optimal control problems
From MaRDI portal
Recommendations
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- A globally convergent and efficient method for unconstrained discrete-time optimal control
- A quasi-Newton differential dynamic programming algorithm for discrete- time optimal control
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 1186893 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3354103 (Why is no real title available?)
- A New Algorithm for Unconstrained Optimization
- Computational aspects of discrete-time optimal control
- Computing Optimal Locally Constrained Steps
- Computing a Trust Region Step
- Convergence in unconstrained discrete-time differential dynamic programming
- Differential dynamic programming and Newton's method
- Partitioned Dynamic Programming for Optimal Control
- Projected Newton Methods for Optimization Problems with Simple Constraints
- The application of optimal control methodology to nonlinear programming problems
- The computation and theory of optimal control
Cited in
(10)- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- A globally convergent and efficient method for unconstrained discrete-time optimal control
- On Pantoja's problem allegedly showing a distinction between differential dynamic programming and stagewise Newton methods
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Cheap Newton steps for optimal control problems: automatic differentiation and Pantoja's algorithm
- Binary optimal control by trust-region steepest descent
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
- A continuous implementation of a second-variation optimal control method for space trajectory problems
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
This page was built for publication: An efficient trust region method for unconstrained discrete-time optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804374)
