A computational method for a class of optimal relaxed control problems

DOI10.1007/BF00938804zbMath0632.49017MaRDI QIDQ1095391

C. J. Goh, Kok Lay Teo

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convergencecontrol parametrizationcomputational schemeoptimal relaxed control problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods of relaxation type (49M20)

Related Items

Approximation of optimal control problems with state constraints ⋮ Convergent computational method for relaxed optimal control problems ⋮ Approximation theory for generalized young measures ⋮ Discretization of nonlinear elliptic optimal control problems ⋮ Approximation of relaxed nonlinear parabolic optimal control problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I
• Computational methods for optimizing distributed systems
• Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems. II: General problem
• Control parametrization: a unified approach to optimal control problems with general constraints
• Numerical solution of a relaxed control problem by the epsilon method
• Recent advances in gradient algorithms for optimal control problems
• Application of relaxed solutions to minimum sensitivity optimal control
• Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems
• Relaxed Controls and the Convergence of Optimal Control Algorithms