A Chebyshev Finite Difference Method For Solving A Class Of Optimal Control Problems
From MaRDI portal
Publication:4449521
DOI10.1080/0020716031000070625zbMath1037.65065OpenAlexW2092508320MaRDI QIDQ4449521
No author found.
Publication date: 11 February 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020716031000070625
Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25)
Related Items (8)
The Boubaker polynomials and their application to solve fractional optimal control problems ⋮ Numerical solutions for constrained time-delayed optimal control problems ⋮ A reliable numerical approach for nonlinear fractional optimal control problems ⋮ Chebyshev-Legendre method for discretizing optimal control problems ⋮ Computation of the canonical polynomials and applications to some optimal control problems ⋮ The Chebyshev–Legendre collocation method for a class of optimal control problems ⋮ Inversion in indirect optimal control of multivariable systems ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Direct and indirect methods for trajectory optimization
- A method for numerical integration on an automatic computer
- Modified quasilinearization algorithm for optimal control problems with nondifferential constraints and general boundary conditions
- Optimization. Algorithms and consistent approximations
- A Chebyshev approximation for solving optimal control problems
- Dual Approximations in Optimal Control
- A Chebyshev technique for solving nonlinear optimal control problems
- Rates of Convergence for Discrete Approximations to Unconstrained Control Problems
- Efficient Spectral-Galerkin Method II. Direct Solvers of Second- and Fourth-Order Equations Using Chebyshev Polynomials
- Second-Order Runge--Kutta Approximations in Control Constrained Optimal Control
- Numerical Solution for Large-Scale Systems with General Multiple Linear-Quadratic Structure
- Consistency of Primal-Dual Approximations for Convex Optimal Control Problems
- Direct optimization using collocation based on high-order Gauss-Lobatto quadrature rules
- Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
- On weak convergence of probability measures, channel capacity and code error probabilities
- An Historical Survey of Computational Methods in Optimal Control
This page was built for publication: A Chebyshev Finite Difference Method For Solving A Class Of Optimal Control Problems
