论文信息 - 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

An algorithm for solving optimal control problems with state and control constraints is presented. The search direction is determined by solving a convex approximation to the original problem and an exact penalty function is employed to determine step length.

E. Polak | D. Mayne | D. Mayne | E. Polak

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

[2] D. Mayne. Strong variation algorithms for optimal control problems with control and terminal inequality constraints , 1973, IEEE Conference on Decision and Control.

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

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

[5] Steepest Descent with Relaxed Controls , 1977 .

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

[7] J. Warga. Iterative procedures for constrained and unilateral optimization problems , 1981, CDC 1981.

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

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

[10] David Q. Mayne,et al. An exact penalty function algorithm for optimal control problems with control and terminal equality constraints, part 2 , 1980 .