Necessary Conditions for Impulsive Nonlinear Optimal Control Problems without a priori Normality Assumptions

First-order and second-order necessary conditions of optimality for an impulsive control problem that remain informative for abnormal control processes are presented and derived. One of the main features of these conditions is that no a priori normality assumptions are required. This feature follows from the fact that these conditions rely on an extremal principle which is proved for an abstract minimization problem with equality constraints, inequality constraints, and constraints given by an inclusion in a convex cone. Two simple examples illustrate the power of the main result.The first author was partially supported by the Russian Foundation for Basic Research Grant 02-01-00334. The second author was partially supported by the Russian Foundation for Basic Research Grant 00-01-00869. The third author was partially supported by Fundacao para a Ciencia e Tecnologia and by INVOTAN Grant.     

随机删失下经验贝叶斯估计的渐近最优性

该文运用经验贝叶斯(empirical Bayes(简称EB))方法,在历史样本和当前样本均被另一个具有未知分布的变量随机右删失的条件下,构造了一个指数分布参数的经验贝叶斯估计并获得了它的渐近最优性．文章最后给出了一个例子和模拟结果．     

Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints

In this paper, we establish global necessary and sufficient optimality conditions for D.C. vector optimization problems under reverse convex constraints. An application to vector fractional mathematical programming is also given. Mathematics Subject Classifications (1991). Primary 90C29, Secondary 49K30.     

On Global Optimality Conditions and Cutting Plane Algorithms

We discuss global optimality conditions and cutting plane algorithms for DC optimization. The discussion is motivated by certain incorrect results that have appeared recently in the literature on these topics. Incidentally, we investigate the relation of the Tikhonov reciprocity theorem to the optimality conditions for general nonconvex global optimization problems and show how the outer-approximation scheme developed earlier for DC programming can be used to solve a wider class of problems.     

Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs

Characterizations of optimality are presented for infinite-dimensional convex programming problems, where the number of constraints is not restricted to be finite and where no constraint qualification is assumed. The optimality conditions are given in asymptotic forms using subdifferentials and €-subdifferentials. They are obtained by employing a version of the Farkas lemma for systems involving convex functions. An extension of the results to problems with a semiconvex objective function is also given.     

Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints

We present sufficient conditions for the global optimality of bivalent nonconvex quadratic programs involving quadratic inequality constraints as well as equality constraints. By employing the Lagrangian function, we extend the global subdifferential approach, developed recently in Jeyakumar et al. (J. Glob. Optim., 2007, to appear; Math. Program. Ser. A, 2007, to appear) for studying bivalent quadratic programs without quadratic constraints, and derive global optimality conditions. The authors are grateful to the referees for constructive comments and suggestions which have contributed to the final preparation of the paper. Z.Y. Wu’s current address: School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Victoria, Australia. The work of this author was completed while at the Department of Applied Mathematics, University of New South Wales, Sydney, Australia.     

Near optimality of stochastic control in systems with unknown parameter processes

Stochastic control for systems with an unknown parameter is considered in this paper. The underlying problem is to minimize a functional subject to a system described by a singularly perturbed differential equation with an unknown parameter process driven by fast fluctuating random disturbances. This problem arises in the context of stochastic adaptive control, adaptive signal processing, and failure-prone manufacturing systems. Due to the nature of the wide-bandwidth noise processes, identifying the parameter process for eacht is very hard since the driving noise changes very rapidly. An alternative approach is used, and an auxiliary control problem is introduced to overcome the difficulties. By means of weak convergence methods and comparison control techniques, nearly optimal controls are obtained.This research was supported in part by the National Science Foundation under Grant DMS-9022139 and DMS-9224372.     

报酬无界的平均准则马氏决策过程

本文对可数状态集、非空决策集、报酬无界的平均准则马氏决策过程，提出了一组新的条件，在此条件下存在（ε）最优平稳策略，且当最优不等式中的和有定义时最优不等式也成立。     

A Projected Gradient Method for Vector Optimization Problems

Vector optimization problems are a significant extension of multiobjective optimization, which has a large number of real life applications. In vector optimization the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative orthant. We consider extensions of the projected gradient gradient method to vector optimization, which work directly with vector-valued functions, without using scalar-valued objectives. We provide a direction which adequately substitutes for the projected gradient, and establish results which mirror those available for the scalar-valued case, namely stationarity of the cluster points (if any) without convexity assumptions, and convergence of the full sequence generated by the algorithm to a weakly efficient optimum in the convex case, under mild assumptions. We also prove that our results still hold when the search direction is only approximately computed.     

Smooth and Nonsmooth Lipschitz Controls for a Class of Vector Differential Equations

This paper is devoted to the study of a class of control problems associated to a nonlinear second-order vector differential equation with pointwise state constraints. The control is realized via a function of the state. We extend the results of Akkouchi, Bounabat, and Goebel to vector differential equations and furthermore consider the more general case. Under proper conditions, we prove the existence of optimal controls in the class of Lipschitz functions and obtain an optimality condition which looks somehow like the Pontryagin maximum principle for a smooth optimal control function. For a nonsmooth optimal control function, we derive a suboptimality condition by means of the Ekeland variational principle.Communicated by M. J. BalasThis work was supported by 985 Project of Jilin University. The author thanks Professor Yong Li for valuable suggestions. He also thanks Professor M. J. Balas and the anonymous referees for their comments.