Discretization methods for optimal control problems with state constraints

DOI10.1016/j.cam.2005.04.020zbMath1095.65055MaRDI QIDQ2490715

John T. Coletsos, Basilis Kokkinis, I. Chryssoverghi

Publication date: 18 May 2006

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.04.020

zbMATH Keywords

discretization; algorithm; optimal control; convergence; numerical examples; relaxed controls; midpoint scheme; penalized gradient projection method; piecewise linear controls

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

93C10: Nonlinear systems in control theory

93C55: Discrete-time control/observation systems

93C15: Control/observation systems governed by ordinary differential equations

Related Items

Convergence of the forward-backward sweep method in optimal control, Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control

Cites Work

• Approximate gradient projection method with Runge-Kutta schemes for optimal control prob\-lems
• Convergent computational method for relaxed optimal control problems
• Discrete approximation of relaxed optimal control problems
• Optimization. Algorithms and consistent approximations
• Mixed Frank-Wolfe penalty method with applications to nonconvex optimal control problems
• On the Time-Discretization of Control Systems
• Second-Order Runge--Kutta Approximations in Control Constrained Optimal Control
• Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item