Abstract
We examine discrete-time optimal control problems with general, possibly non-linear or non-smooth dynamic equations, and state-control inequality and equality constraints. A new generalized convexity condition for the dynamics and constraints is defined, and it is proved that this property, together with a constraint qualification constitute sufficient conditions for the strong Lagrange duality result and saddle-point optimality conditions for the problem. The discrete maximum principle of Pontryagin is obtained in a straightforward manner from the strong Lagrange duality theorem, first in a new form in which the Lagrangian is minimized both with respect to the state and to the control variables. Assuming differentiability, the maximum principle is obtained in the usual form. It is shown that dynamic systems satisfying a global controllability condition with convex costs, have the required convexity property. This controllability condition is a natural extension of the customary directional convexity condition applied in the derivation of the discrete maximum principle for local optima in the literature.
Subject
Computational Mathematics,Control and Optimization,Control and Systems Engineering
Reference35 articles.
1. Bazaraa M.S.,
Sherali H.D. and
Shetty C.M.,
Nonlinear Programming: Theory and Algorithms,
John Wiley & Sons,
New York
(2006)
2. Boltyanskii V.G.,
Optimal Control of Discrete Systems,
John Wiley & Sons,
New York, Toronto, Ontario
(1978)
3. Pontryagin Maximum Principle for Finite Dimensional Nonlinear Optimal Control Problems on Time Scales
4. Optimal sampled-data control, and generalizations on time scales
5. Canon M.D.,
Cullum C. and
Polak E.,
Theory of Optimal Control and Mathematical Programming,
McGraw-Hill,
New York
(1970)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献