Skip to main content
Log in

Convergent computational method for relaxed optimal control problems

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A class of relaxed optimal control problems for ordinary differential equations with a state-space constraint is considered. The discretization by the control parametrization method, formerly proposed by Teo and Goh (Refs. 1, 2), is modified by admitting a tolerance in the state constraint, which enables one to prove a conditional convergence under certain additional qualification on the dynamics. Also, a counterexample is constructed, showing that the original, nonmodified discretization need not approximate the continuous problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Teo, K. L., andGoh, C. J.,Computational Method for a Class of Optimal Relaxed Control Problems, Journal of Optimization Theory and Applications, Vol. 60, pp. 117–133, 1989.

    Google Scholar 

  2. Goh, C. J., andTeo, K. L.,Control Parametrization: A Unified Approach to Optimal Control Problems with General Constraints, Automatica, Vol. 24, pp. 3–18, 1988.

    Google Scholar 

  3. Gamkrelidze, R. V.,Principles of Optimal Control Theory, Tbilisi University Press, Tbilisi, Georgia, USSR, 1977 (In Russian).

    Google Scholar 

  4. Warga, J.,Optimal Control of Differential and Functional Equations, Academic Press, New York, New York, 1972.

    Google Scholar 

  5. Williamsion, L. J., andPolak, E.,Relaxed Controls and Convergence of Algorithms, SIAM Journal on Control and Optimization, Vol. 14, pp. 737–756, 1976.

    Google Scholar 

  6. Roubíček, T.,Constrained Optimization: A General Tolerance Approach, Aplikace Matematiky, Vol. 35, pp. 99–128, 1990.

    Google Scholar 

  7. Miele, A., Pritchard, R. E., andDamoulakis, J. N.,Sequential Gradient-Restoration Algorithm for Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 5, pp. 235–282, 1970.

    Google Scholar 

  8. Miele, A., andWang, T.,Dual Properties of Sequential Gradient-Restoration Algorithms for Optimal Control Problems, Optimization and Related Fields, Edited by R. Contiet al., Springer-Verlag, New York, New York, pp. 331–357, 1986.

    Google Scholar 

  9. Teo, K. L., andWong, K. H.,Nonlinearly Constrained Optimal Control Problems, Applied Mathematics Research Report No. 1990/5, Department of Mathematics, University of Western Australia, Nedlands, Western Australia, Australia, 1990.

    Google Scholar 

  10. Vasilev, F. P.,Methods for Solving Extremal Problems, Nauka, Moscow, USSR, 1981 (in Russian).

    Google Scholar 

  11. Cesari, L.,Optimization: Theory and Applications, Springer-Verlag, New York, New York, 1983.

    Google Scholar 

  12. Roubíček, T.,A Note on an Interaction between Penalization and Discretization, Procedings of the IFIP-IIASA Conference on Modelling and Inverse Problems of Control for Distributed-Parameter Systems, Laxenburg, Austria, 1989.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by A. Miele

The author is grateful to Professor K. L. Teo for useful comments on this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roubćček, T. Convergent computational method for relaxed optimal control problems. J Optim Theory Appl 69, 589–603 (1991). https://doi.org/10.1007/BF00940690

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940690

Key Words

Navigation