论文部分内容阅读
A new SQP type feasible method for inequality constrained optimization is presented,it is a combination of a master algorithm and an auxiliary algorithm which is taken only in finiteiterations. The directions of the master algorithm are generated by only one quadratic programming, and its step-size is always one, the directions of the auxiliary algorithm are new “secondorder” feasible descent. Under suitable assumptions, the algorithm is proved to possess global and strong convergence, superlinear and quadratic convergence.