Necessary conditions for an extremum in the calculus of variations with nonsmooth phase variables

Necessary conditions for an extremum in a general isoperimetric problem not involving partial derivatives with respect to phase variables are obtained. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 922–930, June, 1997. Translated by N. K. Kulman     

年龄相关的半线性种群扩散系统的最优收获控制

研究年龄相关的半线性种群扩散系统的最优收获控制问题，证明了最优收获控制的存在性，得到了收获控制为最优的必要条件和由偏微分方程与变分不等式所构成的最优性组，由最优性组确定最优控制．     

Numerical solution of a nonlinear parabolic control problem by a reduced SQP method

We consider a control problem for a nonlinear diffusion equation with boundary input that occurs when heating ceramic products in a kiln. We interpret this control problem as a constrained optimization problem, and we develop a reduced SQP method that presents for this problem a new and efficient approach of its numerical solution. As opposed to Newton's method for the unconstrained problem, where at each iteration the state must be computed from a set of nonlinear equations,in the proposed algorithm only the linearized state equations need to be solved. Furthermore, by use of a secant update formula, the calculation of exact second derivatives is avoided. In this way the algorithm achieves a substantial decrease in the total cost compared to the implementation of Newton's method in [2]. Our method is practicable with regard to storage requirements, and by choosing an appropriate representation for the null space of the Jacobian of the constraints we are able to exploit the sparsity pattern of the Jacobian in the course of the iteration. We conclude with a presentation of numerical examples that demonstrate the fast two-step superlinear convergence behavior of the method.     

A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones

A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem.     

On optimality conditions for maximizations with respect to cones

For a Pareto maximization problem defined in infinite dimensions in terms of cones, relationships among several types of maximal elements are noted and optimality conditions are developed in terms of tangent cones.     

Optimal Control of a Ship for a Course-Changing Maneuver

The steering control of a ship during a course-changing maneuver is formulated as a Bolza optimal control problem, which is solved via the sequential gradient-restoration algorithm (SGRA). Nonlinear differential equations describing the yaw dynamics of a steering ship are employed as the differential constraints, and both amplitude and slew rate limits on the rudder are imposed. Two performance indices are minimized: one measures the time integral of the squared course deviation between the actual ship course and a target course; the other measures the time integral of the absolute course deviation. Numerical results indicate that a smooth transition from the initial set course to the target course is achievable, with a trade-off between the speed of response and the amount of course angle overshoot.     

First-Order Necessary Optimality Conditions for General Bilevel Programming Problems

In Ref. 1, bilevel programming problems have been investigated using an equivalent formulation by use of the optimal value function of the lower level problem. In this comment, it is shown that Ref. 1 contains two incorrect results: in Proposition 2.1, upper semicontinuity instead of lower semicontinuity has to be used for guaranteeing existence of optimal solutions; in Theorem 5.1, the assumption that the abnormal part of the directional derivative of the optimal value function reduces to zero has to be replaced by the demand that a nonzero abnormal Lagrange multiplier does not exist.     

Convex semi-infinite games

This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inR ⁿ. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.Many thanks are due to the referees for their detailed comments.     

TIME OPTIMAL IMPLUSE CONTROL PROBLEMS

ＴＩＭＥ　ＯＰＴＩＭＡＬ　ＩＭＰＬＵＳＥ　ＣＯＮＴＲＯＬ　ＰＲＯＢＬＥＭＳＴＩＭＥＯＰＴＩＭＡＬＩＭＰＬＵＳＥＣＯＮＴＲＯＬＰＲＯＢＬＥＭＳ￥ＸｕＺｏｎｇｙｕｎ（ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａｐｅｒ，ａｃｌａｓｓ...     

Optimal Control Problems for a Class of Semilinear Multisolution Elliptic Equations

We study the optimal control problem for a class of elliptic problems that may possess multiple solutions. We obtain necessary conditions for optimal control by constructing a related parabolic problem and using known results for the parabolic problem.