具有等式与不等式约束条件拟可微优化的Lagrange乘子型最优性条件

讨论了不等式约束优化问题中拟微分形式下Ｆｒｉｔｚ Ｊｏｈｎ必要条件与 Ｃｌａｒｋｅ广义梯度形式下Ｆｒｉｔｚ Ｊｏｈｎ必要条件的关系．在较弱条件下给出了具有等式与不等式约束条件的两个Ｌａｇｒａｎｇｅ乘子形式的最优性必要条件,在这两个条件中等式约束函数的拟微分和Ｃｌａｒｋｅ广义梯度分别被使用。     

两个凸多面体的差及几种次微分之间的关系

给出两种两个凸多面体差的表达式,利用这些表达式,可以具体计算这两种凸多面体的差,做为应用讨论了利用拟微分计算Penot微分和Clarke广义梯度,特别讨论了一类非光滑函数,极大值函数的光滑复合。     

集值向量优化的二阶最优性条件

对集值映射引入了高阶Clarke导数,给出了判别集值向量优化所有效性的二阶Kuhn-Tucker条件,并且,借助于集值映射的强(弱)伪凸性给出了一个弱有效解的充分条件.     

拟可微函数优化的Lagrange乘子与一阶最优性条件

本文给出了拟可微优化的Fritz John必须条件与Shapiro最优性必要条件的等价性质以及两个最优性充分条件.     

一类复合不可微规划的二阶最优性条件

本文给出了一类复合不可微规划的二阶最优性条件,拓广了R·Fletcher的结论.     

具有算子约束的Lipschitz规划的最优性条件

Barbu等人在文[1]中时目标函数和约束算子都是Frechet可微的情况下证明了具有算子约束的数学规划的最优性必要条件．本文将这一问题推广为目标函数为非光滑的情形,给出了具有算子约束的Lipschitz规划的最优性充分条件和必要条件．     

集值映射的次微分以及最优性条件

基于已有的集值映射的弱次微分的概念,定义了集值映射的Henig全局次微分,研究了它的存在性条件以及运算性质．利用这一概念,分别给出了具约束向量集值最优化问题的Henig全局有效解对的必要性条件和充分性条件．     

向量极值问题的一种含有梯度的最优性条件

本文在赋范空间中引入 G-可微函数的梯度概念 ,利用择一定理 ,我们获得了向量极值问题含有梯度的的最优性条件     

广义梯度和ε-严有效解的最优性条件

在锥序Banach空间中引入了集值映射ε-严有效意义下的广义梯度.在连通性条件下,利用凸集分离定理证明了该广义梯度的存在性.作为应用,给出了用广义梯度刻画集值优化问题ε-严有效解的充分和必要条件.     

一类不可微规划的二阶最优性条件

本文给出了一类复合不可微规划的二阶最优性条件，拓广了Ｒ·Ｆｌｅｔｃｈｅｒ的结论。     

Demyanov Difference of Two Sets and Optimality Conditions of Lagrange Multiplier Type for Constrained Quasidifferentiable Optimization

In the first part of this paper, the Demyanov difference of two sets is considered. An expression for the Demyanov difference of two sets, which are the convex hulls of a finite number of points, is presented. In the second part, first-order necessary optimality conditions of the Lagrange multiplier type, for quasidifferentiable optimization with equality and inequality constraints, are given by means of the Demyanov difference of subdifferential and negative superdifferential.     

THE SECOND-ORDER OPTIMALITY CONDITIONS FOR VARIABLE PROGRAMMING

We study in this paper the continuity of the objective function for variable program- ming. In particular, we study the second-order optimality conditions for unconstrained and constrained variable programming. Some new second-order sufficient and necessary conditions are obtained.     

关于多目标数学规划的最优性条件

本文讨论定义于Ｂａｎａｃｈ空间的多目标数学规划，得到一些ε－最优解和（弱）有效解的必要条件，充分条件和必要充分条件。     

THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

1 IntroductionIt is well known that the most linportant task of nonsmooth is to extend the classicaIderivatives to broaden tl1e scope of dtherentiable function. One of the importallt geuerallzationis the Clarke's generalized directional derivative[1]--[2]…     

OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION

Abstract

In this paper, we study constrained locally Lipschitz vector optimization problems in which the objective and constraint spaces are Hilbert spaces, the decision space is a Banach space, the dominating cone and the constraint cone may be with empty interior. Necessary optimality conditions for this type of optimization problems are derived. A sufficient condition for the existence of approximate efficient solutions to a general vector optimization problem is presented. Necessary conditions for approximate efficient solutions to a constrained locally Lipschitz optimization problem is obtained.     

非凸半定规划的广义Fakars引理及最优性条件

1引言在本文中,我们用(?),S~n,S_ ~n分别表示有限维向量空间,n阶对称矩阵空间及n阶半正定矩阵锥.我们考虑如下形式的非凸半定规划问题:     

Differences of Polyhedra in Matrix Space and Their Applications to Nonsmooth Analysis

Formulas of the differences of polyhedra in matrix space are proposed. Based on these formulas, the differences of polyhedra can be calculated by solving systems of linear inequalities. A modified algorithm for calculating one element of the differences is presented also. The motivation for this work is to compute the Clarke generalized Jacobian, the B-differential, and one of their elements via the quasidifferential. Applications to Newton methods for solving nonsmooth equations are discussed.This project was sponsored by the Shanghai Education Committee, Grant 04EA01, by the Education Ministry of China, and by the Shanghai Government, Grant T0502. The author thanks two anonymous referees and Professor F. Giannessi for valuable suggestions and comments.     

Generalized Bellman-Hamilton-Jacobi optimality conditions for a control problem with a boundary condition

In this paper we study conditions for optimality of a deterministic control problem where the state of the system is required to stop at the boundary. Using the Clarke generalized gradient, we refine the classical verification theorem and show that it is not only sufficient but also necessary for optimality. It is also shown that the solution to the generalized Bellman-Jacobi-Hamilton equation involving the Clarke generalized gradient is unique among the class of regular functions.