Convex parabolic boundary control problems with pointwise state constraints

Optimality conditions and duality are studied for convex parabolic boundary control problems with control constraints and pointwise state constraints. Caused by the presence of state constraints, the multipliers in the optimality conditions and the variables in the dual problem are Borel measures. These measures appear as data in the adjoint partial differential equation. It is shown that its solution as well as the restriction of its solution to the boundary is summable.     

On differentiability with respect to parameter of solutions to convex optimal control problems subject to state space constraints

A family of convex optimal control problems that depend on a real parameterh is considered. The optimal control problems are subject to state space constraints.It is shown that under some regularity conditions on data the solutions of these problems as well as the associated Lagrange multipliers are directionally-differentiable functions of the parameter.The respective right-derivatives are given as the solution and respective Lagrange multipliers for an auxiliary quadratic optimal control problem subject to linear state space constraints.If a condition of strict complementarity type holds, then directional derivatives become continuous ones.     

Stability and sensitivity of solutions to nonlinear optimal control problems

Parameter-dependent optimal control problems for nonlinear ordinary differential equations, subject to control and state constraints, are considered. Sufficient conditions are formulated under which the solutions and the associated Lagrange multipliers are locally Lipschitz continuous and directionally differentiable functions of the parameter. The directional derivatives are characterized.This research was partially supported by Grant No. 3 0256 91 01 from Komitet Bada Naukowych.     

Representation of the Lagrange Multipliers for Optimal Control Problems Subject to Differential-Algebraic Equations of Index Two

Necessary conditions are derived for optimal control problems subject to index-2 differential-algebraic equations, pure state constraints, and mixed control-state constraints. Differential-algebraic equations are composite systems of differential equations and algebraic equations, which arise frequently in practical applications. The structure of the optimal control problem under consideration is exploited and special emphasis is laid on the representation of the Lagrange multipliers resulting from the necessary conditions for infinite optimization problems.The author thanks the referees for careful reading and helpful suggestions and comments.     

Updating the Multipliers Associated with Inequality Constraints in an Augmented Lagrangian Multiplier Method

This paper contributes to the development of the field of augmented Lagrangian multiplier methods for general nonlinear programming by introducing a new update for the multipliers corresponding to inequality constraints. The update maintains naturally the nonnegativity of the multipliers without the need for a positive-orthant projection, as a result of the verification of the first-order necessary conditions for the minimization of a modified augmented Lagrangian penalty function.In the new multiplier method, the roles of the multipliers are interchanged: the multipliers corresponding to the inequality constraints are updated explicitly, whereas the multipliers corresponding to the equality constraints are approximated implicitly. It is shown that the basic properties of local convergence of the traditional multiplier method are valid also for the proposed method.     

Second-Order Sufficient Conditions for State-Constrained Optimal Control Problems

Second-order sufficient optimality conditions (SSC) are derived for an optimal control problem subject to mixed control-state and pure state constraints of order one. The proof is based on a Hamilton-Jacobi inequality and it exploits the regularity of the control function as well as the associated Lagrange multipliers. The obtained SSC involve the strict Legendre-Clebsch condition and the solvability of an auxiliary Riccati equation. They are weakened by taking into account the strongly active constraints.     

Second-order analysis for optimal control problems with pure state constraints and mixed control-state constraints

This paper deals with the optimal control problem of an ordinary differential equation with several pure state constraints, of arbitrary orders, as well as mixed control-state constraints. We assume (i) the control to be continuous and the strengthened Legendre–Clebsch condition to hold, and (ii) a linear independence condition of the active constraints at their respective order to hold. We give a complete analysis of the smoothness and junction conditions of the control and of the constraints multipliers. This allows us to obtain, when there are finitely many nontangential junction points, a theory of no-gap second-order optimality conditions and a characterization of the well-posedness of the shooting algorithm. These results generalize those obtained in the case of a scalar-valued state constraint and a scalar-valued control.     

Properties of the Lagrange multipliers in the Pontryagin maximum principle for optimal control problems with state constraints

We study the Pontryagin maximum principle for an optimal control problem with state constraints. We analyze the continuity of a vector function µ (which is one of the Lagrange multipliers corresponding to an extremal by virtue of the maximum principle) at the points where the extremal trajectory meets the boundary of the set given by the state constraints. We obtain sufficient conditions for the continuity of µ in terms of the smoothness of the extremal trajectory.     

A lagrange multiplier theorem for control problems with state constraints

We prove an existence theorem of Lagrange multipliers for an abstract control problem in Banach spaces. This theorem may be applied to obtain optimality conditions for control problems governed by partial differential equations in the presence of pointwise state constraints.     

Boundary optimal flow control with state constraints

The numerical solution of the Dirichlet boundary optimal control problem of the Navier-Stokes equations in presence of pointwise state constraints is investigated. A Moreau-Yosida regularization of the problem is proposed to obtain regular multipliers. Optimality conditions are derived and the convergence of the regularized solutions towards the original one is presented. The paper ends with a numerical experiment. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Local Minimum Principle for Optimal Control Problems Subject to Differential-Algebraic Equations of Index Two

Necessary conditions in terms of a local minimum principle are derived for optimal control problems subject to index-2 differential-algebraic equations, pure state constraints, and mixed control-state constraints. Differential-algebraic equations are composite systems of differential equations and algebraic equations, which arise frequently in practical applications. The local minimum principle is based on the necessary optimality conditions for general infinite optimization problems. The special structure of the optimal control problem under consideration is exploited and allows us to obtain more regular representations for the multipliers involved. An additional Mangasarian-Fromowitz-like constraint qualification for the optimal control problem ensures the regularity of a local minimum. An illustrative example completes the article.The author thanks the referees for careful reading and helpful suggestions and comments.     

Second-order conditions in stability analysis for state constrained optimal control

The paper presents an outline of the stability results, for state-constrained optimal control problems, recently obtained in Malanowski (Appl. Math. Optim. 55, 255–271, 2007), Malanowski (Optimization, to be published), Malanowski (SIAM J. Optim., to be published). The pricipal novelty of the results is a weakening of the second-order sufficient optimality conditions, under which the solutions and the Lagrange multipliers are locally Lipschitz continuous functions of the parameter. The conditions are weakened by taking into account strongly active state constraints.     

On the choice of the function spaces for some state-constrained control problems

We study a quadratic parabolic control problem with pointwise final state constraints. As the set of admissible states has an empty interior, the existence of Lagrange multipliers cannot be proved directly. We obtain, however some optimality conditions by expressing the fact that among a space of regular perturbations of the optimal control, the null perturbation is optimal. We show that the qualification hypothesis can be effectively checked in some examples and that the information given by the optimality conditions is useful because it allows to get some regularity results for the optimal control.     

Modified quasilinearization algorithm for optimal control problems with nondifferential constraints

This paper considers the numerical solution of optimal control problems involving a functionalI subject to differential constraints, nondifferential constraints, and terminal constraints. The problem is to find the statex(t), the controlu(t), and the parameter π so that the functional is minimized, while the constraints are satisfied to a predetermined accuracy. A modified quasilinearization algorithm is developed. Its main property is the descent property in the performance indexR, the cumulative error in the constraints and the optimality conditions. Modified quasilinearization differs from ordinary quasilinearization because of the inclusion of the scaling factor (or stepsize) α in the system of variations. The stepsize is determined by a one-dimensional search on the performance indexR. Since the first variation δR is negative, the decrease inR is guaranteed if α is sufficiently small. Convergence to the solution is achieved whenR becomes smaller than some preselected value. In order to start the algorithm, some nominal functionsx(t),u(t), π and nominal multipliers λ(t), ρ(t), μ must be chosen. In a real problem, the selection of the nominal functions can be made on the basis of physical considerations. Concerning the nominal multipliers, no useful guidelines have been available thus far. In this paper, an auxiliary minimization algorithm for selecting the multipliers optimally is presented: the performance indexR is minimized with respect to λ(t), ρ(t), μ. Since the functionalR is quadratically dependent on the multipliers, the resulting variational problem is governed by optimality conditions which are linear and, therefore, can be solved without difficulty. To facilitate the numerical solution on digital computers, the actual time θ is replaced by the normalized timet, defined in such a way that the extremal arc has a normalized time length Δt=1. In this way, variable-time terminal conditions are transformed into fixed-time terminal conditions. The actual time τ at which the terminal boundary is reached is regarded to be a component of the parameter π being optimized. The present general formulation differs from that of Ref. 3 because of the inclusion of the nondifferential constraints to be satisfied everywhere over the interval 0?t?1. Its importance lies in that (i) many optimization problems arise directly in the form considered here, (ii) there are problems involving state equality constraints which can be reduced to the present scheme through suitable transformations, and (iii) there are some problems involving inequality constraints which can be reduced to the present scheme through the introduction of auxiliary variables. Numerical examples are presented for the free-final-time case. These examples demonstrate the feasibility as well as the rapidity of convergence of the technique developed in this paper.     

Optimal control of constrained time lag systems: Necessary conditions and numerical treatment

We consider retarded optimal control problems with constant delays in state and control variables under mixed controlstate inequality constraints. First order necessary optimality conditions in the form of Pontryagin's minimum principle are presented and discussed as well as numerical methods based upon discretization techniques and nonlinear programming. The minimum principle for the considered problem class leads to a boundary value problem which is retarded in the state dynamics and advanced in the costate dynamics. It can be shown that the Lagrange multipliers associated with the programming problem provide a consistent discretization of the advanced adjoint equation for the delayed control problem. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

高阶拉氏乘子法和弹性理论中更一般的广义变分原理

作者曾指出[1],弹性理论的最小位能原理和最小余能原理都是有约束条件限制下的变分原理采用拉格朗日乘子法,我们可以把这些约束条件乘上待定的拉氏乘子,计入有关变分原理的泛函内,从而将这些有约束条件的极值变分原理,化为无条件的驻值变分原理.如果把这些待定拉氏乘子和原来的变量都看作是独立变量而进行变分,则从有关泛函的驻值条件就可以求得这些拉氏乘子用原有物理变量表示的表达式.把这些表达式代入待定的拉氏乘子中,即可求所谓广义变分原理的驻值变分泛函.但是某些情况下,待定的拉氏乘子在变分中证明恒等于零.这是一种临界的变分状态.在这种临界状态中,我们无法用待定拉氏乘子法把变分约束条件吸收入泛函,从而解除这个约束条件.从最小余能原理出发,利用待定拉氏乘子法,企图把应力应变关系这个约束条件吸收入有关泛函时,就发生这种临界状态,用拉氏乘子法,从余能原理只能导出Hellinger-Reissner变分原理[2],[3],这个原理中只有应力和位移两类独立变量,而应力应变关系则仍是变分约束条件,人们利用这个条件,从变分求得的应力中求应变.所以Hellinger-Reissner变分原理仍是一种有条件的变分原理.     

Implied constraints and an alternate unified development of nonlinear programming theory

This paper offers an alternate unified view of nonlinear programming theory from the perspective of implied constraints. Optimality is identically characterized for both constrained and unconstrained problems in terms of implied constraints. It is shown that there is a weaker condition than the Guignard constraint qualification for the existence of finite multipliers in the Karush-Kuhn-Tucker conditions. Surprisingly, this condition does not directly qualify the constraints but instead qualifies the objective in terms of implied constraints. More surprisingly, the existence of the finite multipliers follows directly from this objective qualification — it is not necessary for the point to be a local optimum. Methods for generating implied constraints are used to obtain a more general sufficient condition for local and global optimality. A single unified formulation of duality shows that duality is nothing more than an effort to generate the tightest implied constraint. Duality theorems hold in general for this formulation — convexity is not required — and the existence of the duality gap in prior formulations is easily explained. The algorithmic potential of this approach is highlighted by showing that the Simplex method systematically tries to imply the objective from the constraints of the problem.     

Optimality conditions for state constrained nonlinear control problems

The problem of optimal control of nonlinear control and state constrained control problems, where the state constraint may involve differential operators and the cost functionals may be nonsmooth, is studied. For this class of problems, necessary optimality conditions using techniques from infinite dimensional optimization theory adapted to the framework of control problems are derived. It is shown that the underlying structure admits a considerable relaxation of the classical constraint qualifications. The theory then is applied to examples of various nonlinear elliptic equations and state constraints.     

On Weak and Strong Kuhn–Tucker Conditions for Smooth Multiobjective Optimization

We consider a smooth multiobjective optimization problem with inequality constraints. Weak Kuhn?CTucker (WKT) optimality conditions are said to hold for such problems when not all the multipliers of the objective functions are zero, while strong Kuhn?CTucker (SKT) conditions are said to hold when all the multipliers of the objective functions are positive. We introduce a new regularity condition under which (WKT) hold. Moreover, we prove that for another new regularity condition (SKT) hold at every Geoffrion-properly efficient point. We show with an example that the assumption on proper efficiency cannot be relaxed. Finally, we prove that Geoffrion-proper efficiency is not needed when the constraint set is polyhedral and the objective functions are linear.