A DIRECT ALGORITHM WITH n-STEP QUADRATIC CONVERGENCE
一个具有 n 步二次收敛性的直接法算法

A modifiel PY method is proposed.Its main character is that the rotation transformationand Gram-Schmidt orthogonalizing process are used to rectify the set of search directions.Hence,the algorithm remains not only the quadratic termination,but also the n-step quardra-tic convergence for the objective function which is uniform convex.