论文信息 - An exact penalty function algorithm for control problems with state and control constraints

An exact penalty function algorithm for control problems with state and control constraints

This paper describes an exact penalty function algorithm for solving control problems with state, control, and terminal constraints and establishes its convergence properties. A convex optimal control problem is defined whose solution yields a search direction which satisfies the control constraints and reduces a first-order estimate of the exact penalty function. Step length is determined using an Armijo-like procedure. An adaptive procedure for adjusting the penalty parameter completes the algorithm.

D. Mayne | E. Polak

[1] E. Polak,et al. A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints , 1973 .

[2] D. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[3] Elijah Polak,et al. On the global stabilization of locally convergent algorithms , 1976, Autom..

[4] E. Polak,et al. Relaxed Controls and the Convergence of Optimal Control Algorithms , 1976 .

[5] Steepest Descent with Relaxed Controls , 1977 .

[6] D. Mayne,et al. A feasible directions algorithm for optimal control problems with control and terminal inequality constraints , 1977 .

[7] E. Polak,et al. An exact penalty function algorithm for optimal control problems with control and terminal equality constraints, part 1 , 1980 .

[8] Iterative procedures for constrained and unilateral optimization problems , 1982, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[9] Stephen Bevis Smith. An exact penalty function algorithm for constrained optimal control problems , 1983, The 22nd IEEE Conference on Decision and Control.

[10] E. Polak,et al. An exact penalty function algorithm for control problems with state and control constraints , 1985, 1985 24th IEEE Conference on Decision and Control.