SHANG Yi. The CNJK Algorithm Program and Polynomial Convergence of Saddlepoint Conjugate Gradient MethodJ. Journal of Computer Research and Development, 1991, 28(7): 1-5.
Citation:
SHANG Yi. The CNJK Algorithm Program and Polynomial Convergence of Saddlepoint Conjugate Gradient MethodJ. Journal of Computer Research and Development, 1991, 28(7): 1-5.
SHANG Yi. The CNJK Algorithm Program and Polynomial Convergence of Saddlepoint Conjugate Gradient MethodJ. Journal of Computer Research and Development, 1991, 28(7): 1-5.
Citation:
SHANG Yi. The CNJK Algorithm Program and Polynomial Convergence of Saddlepoint Conjugate Gradient MethodJ. Journal of Computer Research and Development, 1991, 28(7): 1-5.
The CNJK Algorithm Program and Polynomial Convergence of Saddlepoint Conjugate Gradient Method
In this paper,the program of CNJK algorithm is proposed.The CNJK consists of the sa- ddlepoint algorithm and saddiepoint conjugate gradient method. It is proyed thai when saddlepoint algorithm can find a feasible solution to the LP problem,the saddlepoint conjugate gradient method bas polynomial convergence.The computational complexity does not exceed O（m2n2）.
DownLoad: