Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-25T08:04:36.079Z Has data issue: false hasContentIssue false
  • English
  • Français

On geometric duality for state-constrained control problems

Published online by Cambridge University Press:  17 April 2009

T.R. Jefferson  and
C.H. Scott
T.R. Jefferson
Affiliation:
School of Mechanical and Industrial Engineering, University of New South Wales, Kensington, New South wales.
C.H. Scott
Affiliation:
School of Mechanical and Industrial Engineering, University of New South Wales, Kensington, New South wales.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For convex optimal control problems without explicit pure state constraints, the structure of dual problems is now well known. However, when these constraints are present and active, the theory of duality is not highly developed. The major difficulty is that the dual variables are not absolutely continuous functions as a result of singularities when the state trajectory hits a state constraint. In this paper we recognize this difficulty by formulating the dual probram in the space of measurable functions. A strong duality theorem is derived. This pairs a primal, state constrained convex optimal control problem with a dual convex control problem that is unconstrained with respect to state constraints. In this sense, the dual problem is computationally more attractive than the primal.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 20 , Issue 2 , April 1979 , pp. 301 - 312
Copyright
Copyright © Australian Mathematical Society 1979

References

[1]Barbu, Viorel, “On the control problem of Bloza in Hilbert spaces”, SIAM J. Control 13 (1975), 1062–1076.CrossRefGoogle Scholar
[2]Ekeland, Ivar, Teman, Roger, Convex analysis and variational problems (Studies in Mathematics and its Applications, 1. North-Holland, Amsterdam, Oxford; American Elsevier, New York; 1976).Google Scholar
[3]Hager, William W. and Mitter, Sanjoy K., “Lagrange duality theory for convex control problems”, SIAM J. Control Optim. 14 (1976), 843–856.CrossRefGoogle Scholar
[4]Heins, W. and Mitter, S.K., “Conjugate convex functions, duality, and optimal control problems I: systems governed by ordinary differential equations”, Inform. Sci. 2 (1970), 211–243.CrossRefGoogle Scholar
[5]Jefferson, T.R. and Scott, C.H., “Generalised geometric programming applied to problems of optimal control. I: theory”, J. Optim. Theory Appl. 26 (1978), 117–129.CrossRefGoogle Scholar
[6]Pearson, John D., “Reciprocity and duality in control programming problems”, J. Math. Anal. Appl. 10 (1965), 388–408.CrossRefGoogle Scholar
[7]Peterson, Elmor L., “Geometric programming”, SIAM Rev. 18 (1976), 1–51.CrossRefGoogle Scholar
[8]Rockafellar, R.T., “Conjugate convex functions in optimal control and the calculus of variations”, J. Math. Anal. Appl. 32 (1970), 174–222.CrossRefGoogle Scholar
[9]Rockafellar, R.T., “Integrals which are convex functionals, II”, Pacific J. Math. 39 (1971), 439–469.CrossRefGoogle Scholar
[10]Rockafellar, R. Tyrrell, “State constraints in convex control problems of Bolza”, SIAM J. Control 10 (1972), 691–715.CrossRefGoogle Scholar
[11]Vinter, R.B., “Application of duality theory to a class of composite cost control problems”, J. Optim. Theory Appl. 13 (1974), 436–460.CrossRefGoogle Scholar