非线性约束条件下一个超线性收敛的可行方法（Ⅱ）———子算法A

A Superlinearly Convergent Feasible Method for Nonlinear Programming with Nonlinear Inequality Constraints (Part Ⅱ) Subalgorithm A 

给出了一个新的子算法Ａ，用以计算本文第一部分提出的主算法Ａ中的“一阶方向”．由于此子算法已充分利用了算法Ａ中已有的信息，所以并没有增加计算量．这样，联合算法Ａ及子算法Ａ。

A new algorithm(Subalgorithm A)is proposed to compute the ‘first order' direction for Algorithm A in part Ⅰ of this paper.Since the subalgorithm uses information in Algorithm A thoroughly, it does not increase the computation amount. So, combining Algorithm A with Subalgorithm A, we can obtain a new practical algorithm.