非线性半定规划若干进展

讨论非线性半定规划的四个专题,包括半正定矩阵锥的变分分析、非凸半定规划问题的最优性条件、非凸半定规划问题的扰动分析和非凸半定规划问题的增广Lagrange方法．     

非线性半定规划若干进展

讨论非线性半定规划的四个专题, 包括半正定矩阵锥的变分分析、非凸半定规划问题的最优性条件、非凸半定规划问题的扰动分析和非凸半定规划问题的增广Lagrange方法.     

模糊多目标半定规划的最优性条件

将模糊集理论应用到多目标半定规划中来,提出了有约束的模糊多目标半定规划模型,并首次给出了其最优有效解的定义.通过构造确定的隶属度函数,将以矩阵为决策变量的模糊多目标半定规划转化为一种目标函数的某些分量由约束函数决定的确定性多目标半定规划,并证明了前者最优有效解与后者有效解的一致性.在此基础之上,讨论了二者的最优性条件.     

半定规划的逆问题

本文提出了半定规划的逆问题,利用半定规划的最优性条件,分别给出了其在ｌ∞,ｌ１,ｌ２ 模意义下的数学模型,它们仍为半定规划问题．     

多目标半定规划的互补弱鞍点和G-鞍点最优性条件

对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题，给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义．然后，在较弱的凸性条件下，利用含矩阵和向量约束的择一性定理，建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件．     

凸半定规划中关于非奇异性的一个等价条件

本文将给出凸半定规划中关于非奇异性的一个等价条件,它可以看作线性半定规划中非奇异性的等价条件的推广.     

C1,1半定规划的二阶最优性条件

该文研究了一类非光滑半定规划问题,其中目标函数是C^1,1函数,约束是半定的. 借助于Peano广义梯度,给出了其二阶最优性必要条件和二阶最优性充分条件     

非光滑多目标半无限规划问题的混合型对偶

该文研究了非光滑多目标半无限规划问题的混合型对偶.首先,利用Lagrange函数介绍了非光滑多目标半无限规划混合型对偶的弱有效解和有效解的定义.其次,利用Dini-伪凸性建立了非光滑多目标半无限规划混合型对偶的弱对偶定理、强对偶定理和逆对偶定理.该文所得结果推广了已有文献中的主要结果.     

非凸半定规划的增广Lagrangian的微分的计算

迄今为止，还未见出版过有关求解非凸半定规划的算法，但在最近，Chen，et.al(2000)和Sun＆Sun(1999)关于非凸半定规划(SDP)的增广Lagrangian的研究是非常有用的，在本文中，我们证明非凸半定规划的增广Lagrangian是可微的，并且给出它的可微表达式．     

非光滑(F,ρ,)θ-d一致不变凸广义分式规划的对偶性

结合F-凸,η-不变凸及d一致不变凸的概念给出了非光滑广义(F,ρ,θ)-d一致不变凸函数;就一类在凸集C上目标函数为Lipschitz连续的带有可微不等式约束的广义分式规划,提出一个对偶,并利用在广义Kuhn-Tucker约束品性或广义Arrow-Hurwicz-Uzawa约束品性的条件下得到的最优性必要条件,证明相应的弱对偶定理、强对偶定理及严格逆对偶定理.     

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

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

First and second order analysis of nonlinear semidefinite programs

In this paper we study nonlinear semidefinite programming problems. Convexity, duality and first-order optimality conditions for such problems are presented. A second-order analysis is also given. Second-order necessary and sufficient optimality conditions are derived. Finally, sensitivity analysis of such programs is discussed.     

Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems

In this paper we consider the standard linear SDP problem, and its low rank nonlinear programming reformulation, based on a Gramian representation of a positive semidefinite matrix. For this nonconvex quadratic problem with quadratic equality constraints, we give necessary and sufficient conditions of global optimality expressed in terms of the Lagrangian function.     

Optimality Conditions and Duality in Nonsmooth Semiinfinite Programming

In this article, we utilize the semiinfinite versions of Guignard's constraint qualification and Motzkin's theorem of the alternative to establish a set of Karush–Kuhn–Tucker-type necessary optimality conditions for a nonsmooth and nonconvex semiinfinite programming problem. Furthermore, we discuss some sufficient optimality conditions and duality relations for our semiinfinite programming problem.     

Optimality conditions and duality results for nonsmooth vector optimization problems with the multiple interval-valued objective function

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval-objective function are convex.     

Optimality and Duality for a Class of Nondifferentiable Multiobjective Fractional Programming Problems

In this paper, we consider a class of nondifferentiable multiobjective fractional programs in which each component of the objective function contains a term involving the support function of a compact convex set. We establish necessary and sufficient optimality conditions and duality results for weakly efficient solutions of nondifferentiable multiobjective fractional programming problems. This work was supported by Grant R01-2003-000-10825-0 from the Basic Research Program of KOSEF.     

C1,1半定规划的二阶最优性条件

研究了C1,1函数类的半定规划问题,其中的目标函数是连续可微的,其梯度是拟可微的.利用拟可微分析分别给出了二阶必要条件和二阶充分条件.     

Optimality and Duality in Nondifferentiable and Multiobjective Programming under Generalized d-Invexity

In this paper, we are concerned with the nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized d-type-I functions. By utilizing the new concepts, Antczak type Karush-Kuhn-Tucker sufficient optimality conditions, Mond-Weir type and general Mond-Weir type duality results are obtained for non-differentiable and multiobjective programming.     

Necessary optimality conditions for a special class of bilevel programming problems with unique lower level solution

We consider a bilevel programming problem in Banach spaces whose lower level solution is unique for any choice of the upper level variable. A condition is presented which ensures that the lower level solution mapping is directionally differentiable, and a formula is constructed which can be used to compute this directional derivative. Afterwards, we apply these results in order to obtain first-order necessary optimality conditions for the bilevel programming problem. It is shown that these optimality conditions imply that a certain mathematical program with complementarity constraints in Banach spaces has the optimal solution zero. We state the weak and strong stationarity conditions of this problem as well as corresponding constraint qualifications in order to derive applicable necessary optimality conditions for the original bilevel programming problem. Finally, we use the theory to state new necessary optimality conditions for certain classes of semidefinite bilevel programming problems and present an example in terms of bilevel optimal control.     

Pseudoinvexity,optimality conditions and efficiency in multiobjective problems; duality

In this paper, we establish characterizations for efficient solutions to multiobjective programming problems, which generalize the characterization of established results for optimal solutions to scalar programming problems. So, we prove that in order for Kuhn–Tucker points to be efficient solutions it is necessary and sufficient that the multiobjective problem functions belong to a new class of functions, which we introduce. Similarly, we obtain characterizations for efficient solutions by using Fritz–John optimality conditions. Some examples are proposed to illustrate these classes of functions and optimality results. We study the dual problem and establish weak, strong and converse duality results.