An Exact Penalty Function Method for Continuous Inequality Constrained Optimal Control Problem
نویسندگان
چکیده
In this paper, we consider a class of optimal control problems subject to equality terminal state constraints and continuous state and control inequality constraints. By using the control parametrization technique and a time scaling transformation, the constrained optimal control problem is approximated by a sequence of optimal parameter selection problems with equality terminal state constraints and continuous state inequality constraints. Each of these constrained optimal parameter selection problems can be regarded as an optimization problem subject to equality constraints and continuous inequality constraints. On this basis, an exact penalty function method is used to devise a computational method to solve these optimization problems with equality constraints and continuous inequality constraints. The main idea is to augment the exact penalty function constructed from the equality constraints and continuous inequality constraints to the objective function, forming a new one. This gives rise to a sequence of unconstrained optimization problems. It is shown that, for sufficiently large penalty parameter value, any local minimizer of the unconstrained optimization problem is a local minimizer of the optimization problem with B. Li · G.R. Duan Center for Control Theory and Guidance Technology, Harbin Institute of Technology, Harbin, China B. Li e-mail: [email protected] G.R. Duan e-mail: [email protected] B. Li · C.J. Yu · K.L. Teo ( ) Department of Mathematics and Statistics, Curtin University, Perth, Australia e-mail: [email protected] C.J. Yu e-mail: [email protected] C.J. Yu Department of Mathematics, Shanghai University, Shanghai, China J Optim Theory Appl (2011) 151:260–291 261 equality constraints and continuous inequality constraints. The convergent properties of the optimal parameter selection problems with equality constraints and continuous inequality constraints to the original optimal control problem are also discussed. For illustration, three examples are solved showing the effectiveness and applicability of the approach proposed.
منابع مشابه
An Exact Penalty Method for Free Terminal Time Optimal Control Problem with Continuous Inequality Constraints
In this paper, we consider a class of optimal control problems with free terminal time and continuous inequality constraints. First, the problem is approximated by representing the control function as a piecewise-constant function. Then, the continuous inequality constraints are transformed into terminal equality constraints for an auxiliary differential system. After these two steps, we transf...
متن کاملA New Exact Penalty Function Method for Continuous Inequality Constrained Optimization Problems∗
In this paper, a computational approach based on a new exact penalty function method is devised for solving a class of continuous inequality constrained optimization problems. The continuous inequality constraints are first approximated by smooth function in integral form. Then, we construct a new exact penalty function, where the summation of all these approximate smooth functions in integral ...
متن کاملThe Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
The exactness of the penalization for the exact l1 penalty function method used for solving nonsmooth constrained optimization problems with both inequality and equality constraints are presented. Thus, the equivalence between the sets of optimal solutions in the nonsmooth constrained optimization problem and its associated penalized optimization problem with the exact l1 penalty function is es...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملProposing a Constrained-GSA for the Vehicle Routing Problem
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 151 شماره
صفحات -
تاریخ انتشار 2011