|
|
系统科学与数学 1990
A SUPERLINEARLY CONVERGENT ALGORITHM BY THE SUBOPTIMAL METHOD FOR LINEARLY CONSTRAINED CONVEX PROGRAMMING PROBLEMS
|
Abstract:
In this papel,the variable metric without constraints is combined with the method of subo-ptimizations on manifolds to solve the nonlinear programming problems with linear contraintsand an algorithm which is superlinearly convergent is given.
