A computational method for a class of optimal relaxed control problems

DOI10.1007/BF00938804MaRDI QIDQ1095391zbMATH OpenFDO

Authors C. J. Goh, Kok Lay Teo

Publication date 1989

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

Full work available at URL https://doi.org/10.1007/BF00938804

zbMATH Keywords

computational schemecontrol parametrizationconvergenceoptimal relaxed control problems

Mathematics Subject Classification ID

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

Review text

We propose a computational scheme for solving a class of optimal relaxed control problems, using the concept of control parametrization. Furthermore, some important convergence properties of the proposed computational scheme are investigated. For illustration, a numerical example is also included.

Recommendations

• Relaxation methods for optimal control problems
• Convergent computational method for relaxed optimal control problems
• scientific article; zbMATH DE number 1163258
• Classical and relaxed optimization methods for optimal control problems
• Approximations of relaxed optimal control problems
• Discretization-optimization methods for relaxed optimal control problems
• A new computational approach to solving a class of optimal control problems
• Analysis of the optimal relaxed control to an optimal control problem
• scientific article; zbMATH DE number 1805984

Cites work

• An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I
• Application of relaxed solutions to minimum sensitivity optimal control
• Computational methods for optimizing distributed systems
• Control parametrization: a unified approach to optimal control problems with general constraints
• scientific article; zbMATH DE number 3798532 (Why is no real title available?)
• scientific article; zbMATH DE number 3283642 (Why is no real title available?)
• scientific article; zbMATH DE number 3400017 (Why is no real title available?)
• Numerical solution of a relaxed control problem by the epsilon method
• Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems
• Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems. II: General problem
• Recent advances in gradient algorithms for optimal control problems
• Relaxed Controls and the Convergence of Optimal Control Algorithms

Cited in

(15)

• Discretization of nonlinear elliptic optimal control problems
• Approximation of relaxed nonlinear parabolic optimal control problems
• Optimal control methodology for the counter-terrorism strategies: the relaxation based approach
• Approximations of relaxed optimal control problems
• Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation scheme
• scientific article; zbMATH DE number 1664847 (Why is no real title available?)
• scientific article; zbMATH DE number 4140626 (Why is no real title available?)
• scientific article; zbMATH DE number 3915078 (Why is no real title available?)
• A computational method for combined optimal parameter selection and optimal control problems with general constraints
• Approximation of optimal control problems with state constraints
• Approximation theory for generalized young measures
• A sequential quadratic Hamiltonian scheme to compute optimal relaxed controls
• scientific article; zbMATH DE number 7117949 (Why is no real title available?)
• The SILP-relaxation method in optimal control: General boundary conditions. II
• Convergent computational method for relaxed optimal control problems

This page was built for publication: A computational method for a class of optimal relaxed control problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095391)