nondifferentiable programming

Second order optimality conditions for nondifferentiable programming;

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

This paper discusses the construction of weighting functions of Bundle algorithms for nondifferentiable programming.

研究不可微规划Ｂｕｎｄｌｅ方法中加权函数的构造，利用ｆ（ｘ）的二阶信息，改进加权函数，给出下降方向的计算，并证明ｆ（ｘ）在最优点的近似最优性条件。