Necessary optimality conditions for nonlinear programming are discussed in the present research. A new second-order condition is given, which depends oil a weak constant rank constraint requirement. We show that pract...
详细信息
Necessary optimality conditions for nonlinear programming are discussed in the present research. A new second-order condition is given, which depends oil a weak constant rank constraint requirement. We show that practical and publicly available algorithms (***/similar to egbirgiii/tango) of augmented Lagrangian type converge, after slight modifications, to stationary points defined by the new condition.
暂无评论