研究了C^1,1函数类的半定规划问题,其中的目标函数是连续可微的,其梯度是拟可微的.利用拟可微分析分别给出了二阶必要条件和二阶充分条件.
In this paper we study C^1,1 semidefinite programming problems, where the objective functions are continuous differentiable and their gradients are quasidifferentiable. Second-order necessary and sufficient optimality conditions in terms of quasidifferential are derived.